[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M7APGEDY7QFDYYYNDDPQH0BK":3,"skill-same:01M7APGEDY7QFDYYYNDDPQH0BK":48},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":16,"categories":17,"keywords":18,"publishedAt":19,"linkOnly":20,"markdownContent":21,"markdownBody":22,"frontMatter":23,"refName":24,"commitSha":25,"skillDirectory":26,"forksCount":27,"repositoryHtmlUrl":28,"repositoryHomepageUrl":29,"ownerHtmlUrl":30,"ownerBlogUrl":31,"ownerDescription":32,"updatedAt":33,"install":34,"resources":47},"01M7APGEDY7QFDYYYNDDPQH0BK","logistics-why-projects-fail-complexity-and-modeling",null,"Use at the start of an optimization project: why these projects fail for organizational and data reasons more often than algorithmic ones, complexity assessed honestly rather than as a verdict, linear programming and duality, mixed-integer programming and branch-and-bound, and how to model well — formulation strength, symmetry breaking, and the modelling choices that decide whether a solver finds anything. Includes the router for the whole logistics-software-optimization reference.","the-vibey-project\u002Fvibey","the-vibey-project","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F329298758?v=4","01M7AJHGZ9722CTJ4JNQZVRH0Q","the vibey project","01M7AJHGZVMG2K7TGXQ6XFHVG3",5,"MIT","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Flogistics-software-optimization\u002Fskills\u002Flogistics-why-projects-fail-complexity-and-modeling\u002FSKILL.md",[],[],"2026-11-15 14:19:17",false,"---\nname: logistics-why-projects-fail-complexity-and-modeling\ndescription: \"Use at the start of an optimization project: why these projects fail for organizational and data reasons more often than algorithmic ones, complexity assessed honestly rather than as a verdict, linear programming and duality, mixed-integer programming and branch-and-bound, and how to model well — formulation strength, symmetry breaking, and the modelling choices that decide whether a solver finds anything. Includes the router for the whole logistics-software-optimization reference.\"\n---\n\n# Logistics and Optimization Software: Why Projects Fail, Complexity, Linear Programming, MIP, and Modeling Well\n\n> **Part 1 of 5** of the *Logistics and Optimization Software* reference (plugin `logistics-software-optimization`), covering §0–§5. Sibling skills: `logistics-constraint-programming-metaheuristics-and-bounds` (§6–§9), `logistics-routing-packing-scheduling-and-network-design` (§10–§16), `logistics-inventory-forecasting-operations-and-solvers` (§17–§24), `logistics-reference` (§25–§31). Section numbers are shared across the set; a reference written as §N → `skill` points into that sibling skill.\n>\n> **Currency:** The algorithms and complexity results are permanent. Two areas are live. See §25 → `logistics-reference` for the solver landscape and the quantum and AI optimization claims.\n\n> **⚠️ Scope.** For engineers building or integrating logistics systems. Complements a\n> data-engineering reference (pipelines), an operations reference (process), and a\n> business reference (unit economics).\n>\n> **⚠️ GOTCHA** boxes mark things that sink projects or silently produce wrong answers.\n>\n> **The three ideas that organize this document:**\n> 1. **⚠️ Optimization projects almost never fail on the algorithm.** **They fail on data\n>    quality, on constraints nobody told you about, and on solutions the drivers refuse to\n>    run** (§1). **The maths is the easy part and it is not where your time goes.**\n> 2. **⚠️ NP-hard does not mean unsolvable — it means no guaranteed-fast exact method.**\n>    **Real instances with tens of thousands of stops are solved to within a few percent\n>    of optimal every night by well-engineered heuristics** (§2, §8 → `logistics-constraint-programming-metaheuristics-and-bounds`).\n> 3. **⚠️ A 2% better solution that operations won't execute is worth 0%.** **Stability,\n>    explainability and consistency with yesterday's plan routinely matter more than the\n>    objective value** (§1, §26 → `logistics-reference`).\n\n---\n\n## §0. Routing\n\n| You want... | Go to |\n|---|---|\n| **⚠️ Why these projects fail** | **§1** |\n| Complexity, honestly | §2 |\n| LP and duality | §3 |\n| MIP and branch-and-bound | §4 |\n| **⚠️ Modeling well** | **§5** |\n| Constraint programming | §6 → `logistics-constraint-programming-metaheuristics-and-bounds` |\n| Metaheuristics | §7 → `logistics-constraint-programming-metaheuristics-and-bounds` |\n| **⚠️ Local search and LNS** | **§8 → `logistics-constraint-programming-metaheuristics-and-bounds`** |\n| Bounds and solution quality | §9 → `logistics-constraint-programming-metaheuristics-and-bounds` |\n| Shortest path and flow | §10 → `logistics-routing-packing-scheduling-and-network-design` |\n| TSP | §11 → `logistics-routing-packing-scheduling-and-network-design` |\n| **⚠️ VRP — the core problem** | **§12 → `logistics-routing-packing-scheduling-and-network-design`** |\n| Packing and loading | §13 → `logistics-routing-packing-scheduling-and-network-design` |\n| Assignment and matching | §14 → `logistics-routing-packing-scheduling-and-network-design` |\n| Scheduling | §15 → `logistics-routing-packing-scheduling-and-network-design` |\n| Facility location and network design | §16 → `logistics-routing-packing-scheduling-and-network-design` |\n| **Inventory** | **§17 → `logistics-inventory-forecasting-operations-and-solvers`** |\n| Forecasting | §18 → `logistics-inventory-forecasting-operations-and-solvers` |\n| **The systems landscape** | **§19 → `logistics-inventory-forecasting-operations-and-solvers`** |\n| Warehouse operations | §20 → `logistics-inventory-forecasting-operations-and-solvers` |\n| Last mile | §21 → `logistics-inventory-forecasting-operations-and-solvers` |\n| **⚠️ Data and distance matrices** | **§22 → `logistics-inventory-forecasting-operations-and-solvers`** |\n| Dynamic and stochastic | §23 → `logistics-inventory-forecasting-operations-and-solvers` |\n| Solvers and tooling | §24 → `logistics-inventory-forecasting-operations-and-solvers` |\n| **What's live** | **§25 → `logistics-reference`** |\n| **⚠️ Anti-patterns** | **§26 → `logistics-reference`** |\n| Misconceptions | §27 → `logistics-reference` |\n| Numbers, books, quick ref | §28–§30 → `logistics-reference` |\n\n---\n\n## §1. ⚠️ Why Optimization Projects Fail\n\n**⚠️ Ranked roughly by how often I'd expect each to be the actual cause:**\n```\n1. ⚠️ THE DATA IS WRONG. Bad addresses, stale service times, wrong vehicle\n   capacities, missing time windows. ⚠️ The optimizer faithfully optimizes\n   a fiction and produces a confidently infeasible plan\n2. ⚠️ HIDDEN CONSTRAINTS. \"You can't send Dave to that site.\" \"That customer\n   must be first.\" \"The forklift can't reach aisle 12 after 3pm.\"\n   ⚠️ These live in people's heads and surface only when the plan is rejected\n3. ⚠️ THE OBJECTIVE ISN'T WHAT THEY SAID. They said \"minimize cost.\" They\n   meant \"don't upset the big customer, keep drivers on familiar routes,\n   and never be late to the hospital\"\n4. ⚠️ NOBODY TRUSTS IT. A black box that outputs a different plan every day\n   loses to a dispatcher's spreadsheet, even when it's better\n5. ⚠️ NO FEASIBLE FALLBACK. Optimizer down or infeasible at 4am → operations\n   halts. ⚠️ You need a degraded mode that always produces SOMETHING\n6. Runtime doesn't fit the operational window\n7. ⚠️ Then, occasionally, the algorithm\n```\n> **⚠️ GOTCHA — solution STABILITY is an unstated requirement in essentially every\n> logistics deployment, and violating it kills more rollouts than poor objective\n> values.** ⚠️ **Re-optimizing from scratch each night produces plans that differ wildly\n> from yesterday's for a 0.3% gain.** **Drivers lose route familiarity, customers lose\n> consistent delivery windows, and planners lose confidence.** **⚠️ Add an explicit\n> penalty for deviation from the incumbent plan, and expose it as a tunable knob.**\n\n**⚠️ What to do about it, in order**: **spend your first weeks on data profiling, not\nmodeling**; ⚠️ **build a feasibility checker and a plan EXPLAINER before you build the\noptimizer** — **\"why is this stop on this route?\" is the question you'll be asked\ndaily**; **run shadow mode against human plans for weeks before switching**; **and\n⚠️ measure against the CURRENT process, not against the theoretical optimum, because that\nis the comparison that determines whether the project survives.**\n\n---\n\n# PART I — OPTIMIZATION FOUNDATIONS\n\n---\n\n## §2. Complexity, Honestly\n\n```\nP            solvable in polynomial time. ⚠️ Shortest path, LP, max flow,\n             assignment, min spanning tree\nNP-complete  ⚠️ decision problems where a solution is checkable fast\nNP-hard      ⚠️ at least as hard. TSP, VRP, bin packing, most scheduling\n```\n> **⚠️ GOTCHA — \"NP-hard\" is routinely used to mean \"impossible,\" and that is wrong in a\n> way that matters commercially.** ⚠️ **It means no known algorithm guarantees optimality\n> in polynomial time IN THE WORST CASE.** **It says nothing about your instances.**\n> **⚠️ TSP instances with tens of thousands of cities have been solved to proven\n> optimality; real VRPs with thousands of stops are routinely solved to within 1–3% of a\n> lower bound in minutes.** **Structure in real data — geographic clustering, tight time\n> windows, capacity limits — often makes practical instances far easier than the worst\n> case.**\n> **⚠️ The correct inference from NP-hardness is \"don't expect a guaranteed-optimal exact\n> method to scale,\" not \"give up.\"**\n\n**⚠️ What actually drives difficulty in practice** — **and it's rarely raw stop count:**\n**the number of INTERACTING constraints; time window tightness (⚠️ tight windows can make\nfinding any feasible solution the hard part); heterogeneous fleets; and multi-objective\ntradeoffs.** ⚠️ **A 500-stop problem with driver skills, time windows, capacity in three\ndimensions, break rules and multi-day horizons is far harder than a 5,000-stop pure\ncapacitated VRP.**\n\n---\n\n## §3. Linear Programming\n\n**⚠️ Continuous variables, linear objective and constraints. Polynomial-time solvable and\nessentially a solved technology — LP is the workhorse underneath everything else.**\n```\nSimplex     ⚠️ exponential worst case, excellent in practice; warm-starts well\nInterior point  polynomial; better on very large sparse problems\n⚠️ DUALITY  every LP has a dual. Dual values = SHADOW PRICES — the marginal\n   value of relaxing a constraint by one unit\n```\n**⚠️ Shadow prices are the most under-used output in applied optimization.** **They tell\nyou what to change about the BUSINESS, not just the plan:** ⚠️ **\"the capacity constraint\nat depot 3 has a shadow price of $400\u002Funit\" is an investment case, and it falls out of the\nsolve for free.**\n**⚠️ Sensitivity analysis matters more than the optimal solution in planning contexts** —\n**how much can a cost change before the plan changes?**\n\n---\n\n## §4. MIP and Branch-and-Bound\n\n**⚠️ Add integrality and you leave P.** **Nearly every logistics decision is integer:\nwhich vehicle, whether to open a facility, which order goes where.**\n```\n⚠️ BRANCH AND BOUND\n  Solve the LP relaxation → a BOUND on the best possible\n  Branch on a fractional variable → two subproblems\n  PRUNE any subproblem whose bound is worse than the incumbent\n⚠️ CUTTING PLANES  add valid inequalities to tighten the relaxation\nBRANCH AND CUT     ⚠️ both. What every modern solver does\n⚠️ PRESOLVE        eliminate variables and constraints before solving.\n   Often the single largest speedup, and it's automatic\nCOLUMN GENERATION \u002F BRANCH AND PRICE  ⚠️ for problems with enormous variable\n   counts — generate columns (e.g. whole routes) as needed. THE technique\n   behind exact VRP and crew scheduling methods\n```\n**⚠️ The MIP gap is the number you actually operate on**: **(incumbent − bound) \u002F\nincumbent.** ⚠️ **A 2% gap means you're provably within 2% of optimal — usually far more\nthan good enough, and often reached in seconds while proving optimality would take\nhours.** **Set a gap tolerance and a time limit. Always.**\n\n---\n\n## §5. ⚠️ Modeling Well\n\n**⚠️ The formulation matters more than the solver. A good model on a free solver beats a\nbad model on an expensive one, routinely.**\n```\n⚠️ TIGHT vs LOOSE formulations. Two models with identical feasible integer\n   sets can have vastly different LP relaxations. ⚠️ The tighter relaxation\n   prunes far more and can be orders of magnitude faster\n⚠️ BIG-M   the classic trap. M too large → weak relaxation, numerical\n   instability, garbage. ⚠️ Use the SMALLEST valid M you can prove\n⚠️ SYMMETRY  identical vehicles\u002Fmachines mean the solver explores equivalent\n   solutions repeatedly. Break it with ordering constraints\nINDICATOR CONSTRAINTS  ⚠️ often better than big-M; solvers handle them natively\nSOS constraints · piecewise linear via SOS2\n⚠️ SOFT CONSTRAINTS  penalize in the objective rather than forbidding.\n   ⚠️ THE most important practical modeling decision — see below\n```\n> **⚠️ GOTCHA — an infeasible model is useless to operations and \"infeasible\" is the worst\n> possible output at 4am.** ⚠️ **Make almost everything soft with a penalty, ordered by\n> business priority: hard constraints only for genuine physical or legal impossibilities.**\n> **Then you always get a plan, and the violations are visible and ranked.**\n> **⚠️ Bonus: penalty weights become the interface where operations expresses priorities,\n> which converts an argument about the algorithm into a conversation about the business.**\n\n**⚠️ Numerical hygiene** — **keep coefficient magnitudes within a few orders of magnitude\nof each other; scale your data.** ⚠️ **Mixing costs in cents with distances in millimetres\nproduces coefficient ranges that make solvers behave erratically and unreproducibly.**\n","# Logistics and Optimization Software: Why Projects Fail, Complexity, Linear Programming, MIP, and Modeling Well\n\n> **Part 1 of 5** of the *Logistics and Optimization Software* reference (plugin `logistics-software-optimization`), covering §0–§5. Sibling skills: `logistics-constraint-programming-metaheuristics-and-bounds` (§6–§9), `logistics-routing-packing-scheduling-and-network-design` (§10–§16), `logistics-inventory-forecasting-operations-and-solvers` (§17–§24), `logistics-reference` (§25–§31). Section numbers are shared across the set; a reference written as §N → `skill` points into that sibling skill.\n>\n> **Currency:** The algorithms and complexity results are permanent. Two areas are live. See §25 → `logistics-reference` for the solver landscape and the quantum and AI optimization claims.\n\n> **⚠️ Scope.** For engineers building or integrating logistics systems. Complements a\n> data-engineering reference (pipelines), an operations reference (process), and a\n> business reference (unit economics).\n>\n> **⚠️ GOTCHA** boxes mark things that sink projects or silently produce wrong answers.\n>\n> **The three ideas that organize this document:**\n> 1. **⚠️ Optimization projects almost never fail on the algorithm.** **They fail on data\n>    quality, on constraints nobody told you about, and on solutions the drivers refuse to\n>    run** (§1). **The maths is the easy part and it is not where your time goes.**\n> 2. **⚠️ NP-hard does not mean unsolvable — it means no guaranteed-fast exact method.**\n>    **Real instances with tens of thousands of stops are solved to within a few percent\n>    of optimal every night by well-engineered heuristics** (§2, §8 → `logistics-constraint-programming-metaheuristics-and-bounds`).\n> 3. **⚠️ A 2% better solution that operations won't execute is worth 0%.** **Stability,\n>    explainability and consistency with yesterday's plan routinely matter more than the\n>    objective value** (§1, §26 → `logistics-reference`).\n\n---\n\n## §0. Routing\n\n| You want... | Go to |\n|---|---|\n| **⚠️ Why these projects fail** | **§1** |\n| Complexity, honestly | §2 |\n| LP and duality | §3 |\n| MIP and branch-and-bound | §4 |\n| **⚠️ Modeling well** | **§5** |\n| Constraint programming | §6 → `logistics-constraint-programming-metaheuristics-and-bounds` |\n| Metaheuristics | §7 → `logistics-constraint-programming-metaheuristics-and-bounds` |\n| **⚠️ Local search and LNS** | **§8 → `logistics-constraint-programming-metaheuristics-and-bounds`** |\n| Bounds and solution quality | §9 → `logistics-constraint-programming-metaheuristics-and-bounds` |\n| Shortest path and flow | §10 → `logistics-routing-packing-scheduling-and-network-design` |\n| TSP | §11 → `logistics-routing-packing-scheduling-and-network-design` |\n| **⚠️ VRP — the core problem** | **§12 → `logistics-routing-packing-scheduling-and-network-design`** |\n| Packing and loading | §13 → `logistics-routing-packing-scheduling-and-network-design` |\n| Assignment and matching | §14 → `logistics-routing-packing-scheduling-and-network-design` |\n| Scheduling | §15 → `logistics-routing-packing-scheduling-and-network-design` |\n| Facility location and network design | §16 → `logistics-routing-packing-scheduling-and-network-design` |\n| **Inventory** | **§17 → `logistics-inventory-forecasting-operations-and-solvers`** |\n| Forecasting | §18 → `logistics-inventory-forecasting-operations-and-solvers` |\n| **The systems landscape** | **§19 → `logistics-inventory-forecasting-operations-and-solvers`** |\n| Warehouse operations | §20 → `logistics-inventory-forecasting-operations-and-solvers` |\n| Last mile | §21 → `logistics-inventory-forecasting-operations-and-solvers` |\n| **⚠️ Data and distance matrices** | **§22 → `logistics-inventory-forecasting-operations-and-solvers`** |\n| Dynamic and stochastic | §23 → `logistics-inventory-forecasting-operations-and-solvers` |\n| Solvers and tooling | §24 → `logistics-inventory-forecasting-operations-and-solvers` |\n| **What's live** | **§25 → `logistics-reference`** |\n| **⚠️ Anti-patterns** | **§26 → `logistics-reference`** |\n| Misconceptions | §27 → `logistics-reference` |\n| Numbers, books, quick ref | §28–§30 → `logistics-reference` |\n\n---\n\n## §1. ⚠️ Why Optimization Projects Fail\n\n**⚠️ Ranked roughly by how often I'd expect each to be the actual cause:**\n```\n1. ⚠️ THE DATA IS WRONG. Bad addresses, stale service times, wrong vehicle\n   capacities, missing time windows. ⚠️ The optimizer faithfully optimizes\n   a fiction and produces a confidently infeasible plan\n2. ⚠️ HIDDEN CONSTRAINTS. \"You can't send Dave to that site.\" \"That customer\n   must be first.\" \"The forklift can't reach aisle 12 after 3pm.\"\n   ⚠️ These live in people's heads and surface only when the plan is rejected\n3. ⚠️ THE OBJECTIVE ISN'T WHAT THEY SAID. They said \"minimize cost.\" They\n   meant \"don't upset the big customer, keep drivers on familiar routes,\n   and never be late to the hospital\"\n4. ⚠️ NOBODY TRUSTS IT. A black box that outputs a different plan every day\n   loses to a dispatcher's spreadsheet, even when it's better\n5. ⚠️ NO FEASIBLE FALLBACK. Optimizer down or infeasible at 4am → operations\n   halts. ⚠️ You need a degraded mode that always produces SOMETHING\n6. Runtime doesn't fit the operational window\n7. ⚠️ Then, occasionally, the algorithm\n```\n> **⚠️ GOTCHA — solution STABILITY is an unstated requirement in essentially every\n> logistics deployment, and violating it kills more rollouts than poor objective\n> values.** ⚠️ **Re-optimizing from scratch each night produces plans that differ wildly\n> from yesterday's for a 0.3% gain.** **Drivers lose route familiarity, customers lose\n> consistent delivery windows, and planners lose confidence.** **⚠️ Add an explicit\n> penalty for deviation from the incumbent plan, and expose it as a tunable knob.**\n\n**⚠️ What to do about it, in order**: **spend your first weeks on data profiling, not\nmodeling**; ⚠️ **build a feasibility checker and a plan EXPLAINER before you build the\noptimizer** — **\"why is this stop on this route?\" is the question you'll be asked\ndaily**; **run shadow mode against human plans for weeks before switching**; **and\n⚠️ measure against the CURRENT process, not against the theoretical optimum, because that\nis the comparison that determines whether the project survives.**\n\n---\n\n# PART I — OPTIMIZATION FOUNDATIONS\n\n---\n\n## §2. Complexity, Honestly\n\n```\nP            solvable in polynomial time. ⚠️ Shortest path, LP, max flow,\n             assignment, min spanning tree\nNP-complete  ⚠️ decision problems where a solution is checkable fast\nNP-hard      ⚠️ at least as hard. TSP, VRP, bin packing, most scheduling\n```\n> **⚠️ GOTCHA — \"NP-hard\" is routinely used to mean \"impossible,\" and that is wrong in a\n> way that matters commercially.** ⚠️ **It means no known algorithm guarantees optimality\n> in polynomial time IN THE WORST CASE.** **It says nothing about your instances.**\n> **⚠️ TSP instances with tens of thousands of cities have been solved to proven\n> optimality; real VRPs with thousands of stops are routinely solved to within 1–3% of a\n> lower bound in minutes.** **Structure in real data — geographic clustering, tight time\n> windows, capacity limits — often makes practical instances far easier than the worst\n> case.**\n> **⚠️ The correct inference from NP-hardness is \"don't expect a guaranteed-optimal exact\n> method to scale,\" not \"give up.\"**\n\n**⚠️ What actually drives difficulty in practice** — **and it's rarely raw stop count:**\n**the number of INTERACTING constraints; time window tightness (⚠️ tight windows can make\nfinding any feasible solution the hard part); heterogeneous fleets; and multi-objective\ntradeoffs.** ⚠️ **A 500-stop problem with driver skills, time windows, capacity in three\ndimensions, break rules and multi-day horizons is far harder than a 5,000-stop pure\ncapacitated VRP.**\n\n---\n\n## §3. Linear Programming\n\n**⚠️ Continuous variables, linear objective and constraints. Polynomial-time solvable and\nessentially a solved technology — LP is the workhorse underneath everything else.**\n```\nSimplex     ⚠️ exponential worst case, excellent in practice; warm-starts well\nInterior point  polynomial; better on very large sparse problems\n⚠️ DUALITY  every LP has a dual. Dual values = SHADOW PRICES — the marginal\n   value of relaxing a constraint by one unit\n```\n**⚠️ Shadow prices are the most under-used output in applied optimization.** **They tell\nyou what to change about the BUSINESS, not just the plan:** ⚠️ **\"the capacity constraint\nat depot 3 has a shadow price of $400\u002Funit\" is an investment case, and it falls out of the\nsolve for free.**\n**⚠️ Sensitivity analysis matters more than the optimal solution in planning contexts** —\n**how much can a cost change before the plan changes?**\n\n---\n\n## §4. MIP and Branch-and-Bound\n\n**⚠️ Add integrality and you leave P.** **Nearly every logistics decision is integer:\nwhich vehicle, whether to open a facility, which order goes where.**\n```\n⚠️ BRANCH AND BOUND\n  Solve the LP relaxation → a BOUND on the best possible\n  Branch on a fractional variable → two subproblems\n  PRUNE any subproblem whose bound is worse than the incumbent\n⚠️ CUTTING PLANES  add valid inequalities to tighten the relaxation\nBRANCH AND CUT     ⚠️ both. What every modern solver does\n⚠️ PRESOLVE        eliminate variables and constraints before solving.\n   Often the single largest speedup, and it's automatic\nCOLUMN GENERATION \u002F BRANCH AND PRICE  ⚠️ for problems with enormous variable\n   counts — generate columns (e.g. whole routes) as needed. THE technique\n   behind exact VRP and crew scheduling methods\n```\n**⚠️ The MIP gap is the number you actually operate on**: **(incumbent − bound) \u002F\nincumbent.** ⚠️ **A 2% gap means you're provably within 2% of optimal — usually far more\nthan good enough, and often reached in seconds while proving optimality would take\nhours.** **Set a gap tolerance and a time limit. Always.**\n\n---\n\n## §5. ⚠️ Modeling Well\n\n**⚠️ The formulation matters more than the solver. A good model on a free solver beats a\nbad model on an expensive one, routinely.**\n```\n⚠️ TIGHT vs LOOSE formulations. Two models with identical feasible integer\n   sets can have vastly different LP relaxations. ⚠️ The tighter relaxation\n   prunes far more and can be orders of magnitude faster\n⚠️ BIG-M   the classic trap. M too large → weak relaxation, numerical\n   instability, garbage. ⚠️ Use the SMALLEST valid M you can prove\n⚠️ SYMMETRY  identical vehicles\u002Fmachines mean the solver explores equivalent\n   solutions repeatedly. Break it with ordering constraints\nINDICATOR CONSTRAINTS  ⚠️ often better than big-M; solvers handle them natively\nSOS constraints · piecewise linear via SOS2\n⚠️ SOFT CONSTRAINTS  penalize in the objective rather than forbidding.\n   ⚠️ THE most important practical modeling decision — see below\n```\n> **⚠️ GOTCHA — an infeasible model is useless to operations and \"infeasible\" is the worst\n> possible output at 4am.** ⚠️ **Make almost everything soft with a penalty, ordered by\n> business priority: hard constraints only for genuine physical or legal impossibilities.**\n> **Then you always get a plan, and the violations are visible and ranked.**\n> **⚠️ Bonus: penalty weights become the interface where operations expresses priorities,\n> which converts an argument about the algorithm into a conversation about the business.**\n\n**⚠️ Numerical hygiene** — **keep coefficient magnitudes within a few orders of magnitude\nof each other; scale your data.** ⚠️ **Mixing costs in cents with distances in millimetres\nproduces coefficient ranges that make solvers behave erratically and unreproducibly.**\n",{"name":5,"description":7},"develop","ae32736a1aabddabca5d2c96d665aa0ebc7d8700","src\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Flogistics-software-optimization\u002Fskills\u002Flogistics-why-projects-fail-complexity-and-modeling",3,"https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey","https:\u002F\u002Fthe-vibey-project.github.io\u002Fvibey\u002F","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project","https:\u002F\u002Fvibewithadam.matthewsteinberger.com","freedom for software engineers","2026-11-15 05:47:42",{"source":8,"skillName":5,"commands":35,"prompt":45,"zipAvailable":46},[36,39,42],{"tool":37,"command":38},"npx","npx skills add the-vibey-project\u002Fvibey --skill logistics-why-projects-fail-complexity-and-modeling",{"tool":40,"command":41},"bunx","bunx skills add the-vibey-project\u002Fvibey --skill logistics-why-projects-fail-complexity-and-modeling",{"tool":43,"command":44},"pnpm","pnpm dlx skills add the-vibey-project\u002Fvibey --skill logistics-why-projects-fail-complexity-and-modeling","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Flogistics-software-optimization\u002Fskills\u002Flogistics-why-projects-fail-complexity-and-modeling\u002FSKILL.md",true,[],[49,56,63,70,77,84],{"skillNo":50,"name":51,"nameZh":6,"description":52,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":53,"categories":54,"keywords":55,"publishedAt":19},"01M7AT1FQJAE1FQYAMDTF490Y4","white-paper-writing","Use when writing white papers, technical reports, policy documents, thought leadership pieces, or any long-form authoritative document. Triggers on requests to write, structure, outline, or review white papers, technical reports, position papers, policy briefs, or evidence-driven arguments. Also use for B2B content marketing strategy, technical documentation requiring authority, academic-style reports, or any document that must educate while persuading. Use when someone asks \"how should I structure this\" for a long-form document.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fwhite-paper-writing\u002FSKILL.md",[],[],{"skillNo":57,"name":58,"nameZh":6,"description":59,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":60,"categories":61,"keywords":62,"publishedAt":19},"01M7AT16BJRJJKK2MASXRZS76G","prose-technical-mechanics","Use when editing or writing prose at a technical\u002Fmechanical level: choosing between Anglo-Saxon and Latinate diction, placing information in topic vs stress positions, writing periodic vs cumulative sentences, handling sentence rhythm, punctuation as logic, transitions, paragraph structure, or phonesthetics. Use when someone wants to understand WHY prose works or doesn't, not just surface-level style advice. Triggers on word choice, sentence structure, emphasis, rhythm, diction, or any deep writing mechanics question.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fprose-technical-mechanics\u002FSKILL.md",[],[],{"skillNo":64,"name":65,"nameZh":6,"description":66,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":67,"categories":68,"keywords":69,"publishedAt":19},"01M7AT0W9HT0ZZ9Y287NW99MR3","prose-mechanics","Use when writing, editing, or analyzing prose style; when trying to avoid generic AI-sounding writing; when applying specific prose styles such as journalistic, academic, narrative, KJV biblical, Hemingway plain, Latinate\u002FJamesian, Orwellian, Augustan, Victorian, Early Modern (Bacon, Browne, Milton), or free indirect discourse; or when coaching someone on writing voice and mechanics. Triggers on any request to improve, analyze, or write in a specific prose style, to fix \"AI-sounding\" writing, to make prose more vivid or concrete, to vary sentence rhythm, or to understand how a particular writer achieves their effects.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fprose-mechanics\u002FSKILL.md",[],[],{"skillNo":71,"name":72,"nameZh":6,"description":73,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":74,"categories":75,"keywords":76,"publishedAt":19},"01M7AT0KR635JX66X2X6F3E2CP","narrative-structure","Use when structuring stories, pitches, presentations, white papers, or any persuasive narrative; analyzing the hero's journey in fiction or non-fiction; applying StoryBrand for business communication; designing narrative arcs for thought leadership; or understanding Vogler, Snyder, Propp, or Campbell frameworks. Triggers on any narrative structure, storytelling, pitch structure, StoryBrand, hero's journey, three-act structure, Freytag, Save the Cat, narrative arc, or \"how should I structure this story\u002Fpitch\u002Fpresentation\" request.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fnarrative-structure\u002FSKILL.md",[],[],{"skillNo":78,"name":79,"nameZh":6,"description":80,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":81,"categories":82,"keywords":83,"publishedAt":19},"01M7AT0AKGW09NKKZDYBT8VRDE","legal-brief-writing","Use when writing legal briefs, motions, or any court filing; when analyzing judicial cognition and persuasion; when applying elite brief-writing techniques from Roberts, Clement, Kagan, Garner; or when structuring legal arguments for maximum persuasion. Also use for autistic\u002Fneurodivergent advocates who need to understand how their natural communication style maps to elite legal advocacy. Triggers on any legal writing, brief drafting, motion preparation, or legal argument structuring request.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Flegal-brief-writing\u002FSKILL.md",[],[],{"skillNo":85,"name":86,"nameZh":6,"description":87,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":88,"categories":89,"keywords":90,"publishedAt":19},"01M7AT00VWPS4Q8B5VEMXX9NQT","journal-publishability-criteria","Use whenever a research paper, article or preprint is being written, revised, reviewed or published, and specifically before every publication of docs\u002Fpaper.md. Covers what legitimate journals actually gate on, in order of gating — the editor's desk screen (scope, novelty, package problems), what reviewers judge (methodological soundness, claims the evidence can carry, statistical and qualitative reporting), EQUATOR reporting guidelines, the ICMJE authorship criteria, COPE's view of text recycling, the near-universal generative-AI policy (no AI author, disclosure, author responsibility), TOP 2025 transparency standards, how to verify a journal is legitimate, submitting without an institution, and a pre-submission checklist. Triggers on requests to evaluate, review, prepare or submit a paper, to judge publishability, to write a declarations or data-availability section, to disclose AI use, or to check a journal.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fjournal-publishability-criteria\u002FSKILL.md",[],[]]