--- id: wiki-2026-0508-linear-programming title: Linear Programming category: 10_Wiki/Topics status: needs_review canonical_id: self aliases: [P-Reinforce-AUTO-LIPR-001] duplicate_of: none source_trust_level: A confidence_score: 0.95 tags: [auto-reinforced, linear-programming, Optimization, algorithms, Operations-Research, constraints] raw_sources: [] last_reinforced: 2026-04-20 github_commit: pending inferred_by: Claude Opus 4.7 (auto-normalize 2026-05-08) tech_stack: language: unspecified framework: unspecified --- # [[Linear-Programming|Linear-Programming]] ## πŸ“Œ ν•œ 쀄 톡찰 (The Karpathy Summary) > "ν˜„μ‹€μ μΈ μ΅œμ„ μ˜ νƒ€ν˜‘: 'μ˜ˆμ‚°'은 μ–Όλ§ˆκ³  'μ‹œκ°„'은 λΆ€μ‘±ν•˜λ‹€λŠ” μˆ˜λ§Žμ€ μ œμ•½ 쑰건 μ†μ—μ„œ, 이읡을 μ΅œλŒ€ν™”ν•˜κ±°λ‚˜ λΉ„μš©μ„ μ΅œμ†Œν™”ν•˜λŠ” ν™©κΈˆ 해닡을 μ„ ν˜• λ°©μ •μ‹μ΄λΌλŠ” μˆ˜μ‹μ„ 톡해 μ°Ύμ•„λ‚΄λŠ” μ΅œμ ν™”μ˜ 정석." ## πŸ“– κ΅¬μ‘°ν™”λœ 지식 (Synthesized Content) μ„ ν˜• κ³„νšλ²•(Linear-Programming, LP)은 μ œμ•½ 쑰건이 μžˆλŠ” μƒν™©μ—μ„œ μ„ ν˜• ν•¨μˆ˜μ˜ μ΅œλŒ“κ°’μ΄λ‚˜ μ΅œμ†Ÿκ°’μ„ κ΅¬ν•˜λŠ” μˆ˜ν•™μ  λ°©λ²•μž…λ‹ˆλ‹€. 1. **3λŒ€ μš”μ†Œ**: * **Objective Function**: μš°λ¦¬κ°€ κ·ΉλŒ€ν™”ν•˜λ €λŠ” 것 (예: 수읡). * **Decision Variables**: μš°λ¦¬κ°€ μ‘°μ •ν•  수 μžˆλŠ” κ°’ (예: μƒμ‚°λŸ‰). * **Constraints**: μš°λ¦¬κ°€ λ„˜μ–΄μ„œλŠ” μ•ˆ 될 λ²½ (예: μ˜ˆμ‚°, μžμ› λΆ€μ‘±). 2. **ν™œμš© λΆ„μ•Ό**: * λΉ„ν–‰κΈ° μ’Œμ„ λ…Έμ„  배치, 곡μž₯ 생산 μŠ€μΌ€μ€„λ§, μ˜μ–‘ κ· ν˜• 식단 짜기 λ“±. ([[Combinatorial-Optimization|Combinatorial-Optimization]]와 μ—°κ²°) ## ⚠️ λͺ¨μˆœ 및 μ—…λ°μ΄νŠΈ (Contradictions & Updates) - **κ³Όκ±° λ°μ΄ν„°μ™€μ˜ 좩돌**: κ³Όκ±°μ—λŠ” λ³€μˆ˜κ°€ λͺ‡ 개 μ—†λŠ” λ‹¨μˆœ 계산 μ •μ±…μ΄μ—ˆμœΌλ‚˜, ν˜„λŒ€ 정책은 μΊ„λ§ˆλ₯΄μΉ΄λ₯΄ μ•Œκ³ λ¦¬μ¦˜ μ •μ±… 등을 ν™œμš©ν•΄ 수백만 개의 λ³€μˆ˜λ₯Ό κ°€μ§„ μ „ 지ꡬ적 λ¬Όλ₯˜λ§ μ •μ±… 등을 μ΅œμ ν™”ν•˜λŠ” λ‹¨κ³„λ‘œ μ§„μž…ν•¨(RL Update). - **μ •μ±… λ³€ν™”(RL Update)**: λ‹¨μˆœ LP 정책을 λ„˜μ–΄, λ³€μˆ˜κ°€ μ •μˆ˜μ—¬μ•Ό ν•˜κ±°λ‚˜(Integer Programming) 관계가 λΉ„μ„ ν˜•μΈ κ²½μš°κΉŒμ§€ μ•„μš°λ₯΄λŠ” 'ν˜„λŒ€μ  운영 κ³Όν•™(OR) μ •μ±…'으둜 μ§„ν™”ν•˜λ©° AI의 κ²°μ • 보쑰 도ꡬ μ •μ±…μœΌλ‘œ κ°•λ ₯ν•˜κ²Œ μž‘λ™ν•¨. ## πŸ”— 지식 μ—°κ²° (Graph) - [[Optimization|Optimization]], [[Combinatorial-Optimization|Combinatorial-Optimization]], [[Search-Optimization|Search-Optimization]], [[Decision Theory|Decision Theory]], [[Efficiency|Efficiency]] - **Modern Tech/Tools**: Simplex algorithm, Gurobi, IBM CPLEX, Microsoft Excel Solver. --- ## πŸ€– LLM ν™œμš© 힌트 (How to Use This Knowledge) **μ–Έμ œ 이 지식을 μ“°λŠ”κ°€:** - *(TODO)* **μ–Έμ œ μ“°λ©΄ μ•ˆ λ˜λŠ”κ°€:** - *(TODO)* ## πŸ§ͺ 검증 μƒνƒœ (Validation) - **정보 μƒνƒœ:** needs_review - **좜처 신뒰도:** A - **κ²€ν†  이유:** *(P-Reinforce Phase 1 μžλ™ μ •κ·œν™”. λ³Έλ¬Έ 검증 ν•„μš”.)* ## 🧬 쀑볡 검사 (Duplicate Check) - **κΈ°μ‘΄ μœ μ‚¬ λ¬Έμ„œ:** *(TODO: μΈλ±μ„œ ν΄λŸ¬μŠ€ν„° 리포트 μ°Έμ‘°)* - **처리 방식:** UPDATE (μžλ™ μ •κ·œν™”) - **처리 이유:** Phase 1 μ •κ·œν™” β€” μ˜› ν…œν”Œλ¦Ώ/λˆ„λ½ ν•„λ“œ 보강. ## πŸ•“ λ³€κ²½ 이λ ₯ (Changelog) | λ‚ μ§œ | λ³€κ²½ λ‚΄μš© | 처리 방식 | 신뒰도 | |------|-----------|-----------|--------| | 2026-05-08 | P-Reinforce Phase 1 μ •κ·œν™” (frontmatter + 헀더 ν‘œμ€€ν™”) | UPDATE | A | ## πŸ’» μ½”λ“œ νŒ¨ν„΄ (Code Patterns) **νŒ¨ν„΄ 1:** *(TODO: 이 ν”„λ‘œμ νŠΈ μ»¨λ²€μ…˜ λ°˜μ˜ν•œ ꡬ쑰 μŠ€μΌˆλ ˆν†€)* ```text # TODO ``` ## πŸ€” μ˜μ‚¬κ²°μ • κΈ°μ€€ (Decision Criteria) **선택 Aλ₯Ό 써야 ν•  λ•Œ:** - *(TODO)* **선택 Bλ₯Ό 써야 ν•  λ•Œ:** - *(TODO)* **κΈ°λ³Έκ°’:** > *(TODO)* ## ❌ μ•ˆν‹°νŒ¨ν„΄ (Anti-Patterns) - **[μ•ˆν‹°νŒ¨ν„΄]:** *(TODO: 무엇을 ν•˜λ©΄ μ•ˆ λ˜λŠ”κ°€ + 이유 + λŒ€μ‹  무엇을)*