📚 Linear Programming for A-Level Computer Science | 面向 A-Level 计算机科学的线性规划
Linear programming (LP) is a mathematical technique for finding the best outcome in a model whose requirements are represented by linear relationships. In computer science, LP appears in resource scheduling, network flow, compiler optimisation and decision support systems. This article explains the core ideas, the graphical method, the simplex algorithm, complexity consequences and exam-style guidance for Edexcel A-Level Computer Science.
线性规划（LP）是一种数学技术，用于在需求由线性关系表示的模型中寻找最佳结果。在计算机科学中，线性规划出现在资源调度、网络流、编译器优化和决策支持系统中。本文讲解核心概念、图解法、单纯形算法、复杂性影响以及面向 Edexcel A-Level 计算机科学的考试风格指导。
1. What Is Linear Programming? | 什么是线性规划？
Linear programming deals with optimising a linear objective function subject to a set of linear equality or inequality constraints. The word ‘programming’ here means planning rather than computer programming, although computers are now the main tool used to solve LP problems.
线性规划处理的是在一组线性等式或不等式约束下优化一个线性目标函数的问题。这里的 ‘programming’ 表示规划而非计算机编程，尽管计算机现在是求解线性规划问题的主要工具。
An LP problem consists of decision variables, an objective such as maximising profit or minimising cost, and constraints such as CPU core limits, memory capacity or bandwidth availability.
线性规划问题由决策变量、目标（例如利润最大化或成本最小化）以及约束（例如 CPU 核心数限制、内存容量或带宽可用量）组成。
- Decision variables | 决策变量: unknown quantities the solver can control, such as
Published by TutorHao | A-Level Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导