Loading course records
Optimization is constrained choice
An optimum is meaningful only relative to feasible decisions and stated objectives.
Loading course records
01:640:354 · Mathematics · School 01 — New Brunswick School of Arts and Sciences
Linear Optimization introduces linear programming and the methods used to solve and interpret constrained optimization problems. Rutgers lists the simplex method, duality, sensitivity analysis, integer programming, transportation problems, network flows, and applications, with Introductory Linear Algebra as prerequisite.
How hard?
Students rate teaching
SIRS · 1,520 responses · 2014–2025
Spring 2027
7 open in snapshot
When it meets
Livingston
AI-generated overview
Higher means more demanding · AI summary
5 units · topic sequence may vary by instructor
Students translate objectives, resources, and constraints into variables, inequalities, and a feasible region.
Geometric structure explains vertices, optimality, and why linear programs can be solved through boundary solutions.
The simplex method moves through structured candidate solutions while tracking objective improvement and feasibility.
Dual problems and sensitivity analysis interpret resource values and how robust an optimum is to changing inputs.
Special structures support discrete decisions, flows, assignments, and other applications.
An optimum is meaningful only relative to feasible decisions and stated objectives.
Its shape encodes what combinations of decisions are allowed.
The dual reframes resource constraints as values and tradeoffs.
Decision-makers need to know whether a result survives changing inputs.
Common pitfall
Instead
Write the decision sentence before writing the objective function.
Common pitfall
Instead
Check every candidate against every constraint, including nonnegativity.
Common pitfall
Instead
Explain which constraints bind and what the shadow prices mean.
7 open · Livingston
| Section | Status | Instructor | Meeting | Campus |
|---|---|---|---|---|
| 0115958 | Open | Tuesday 10:20 AM-11:40 AM at BE 252; Friday 10:20 AM-11:40 AM at BE 252BE 252 | Livingston | |
| 0215959 | Open | Tuesday 7:30 PM-8:50 PM at BRR 5105; Thursday 7:30 PM-8:50 PM at BRR 5105BRR 5105 | Livingston | |
| 0315960 | Open | Tuesday 12:10 PM-1:30 PM at LSH B269; Friday 12:10 PM-1:30 PM at LSH B269LSH B269 | Livingston | |
| 0415961 | Open | Monday 8:30 AM-9:50 AM at BRR 5071; Thursday 8:30 AM-9:50 AM at BRR 5071BRR 5071 | Livingston | |
| 0515962 | Open | Monday 10:20 AM-11:40 AM at TIL 253; Thursday 10:20 AM-11:40 AM at TIL 253TIL 253 | Livingston | |
| 0615963 | Open | Tuesday 2:00 PM-3:20 PM at TIL 246; Thursday 2:00 PM-3:20 PM at TIL 246TIL 246 | Livingston | |
| 0715964 | Open | Tuesday 8:30 AM-9:50 AM at LSH B115; Friday 8:30 AM-9:50 AM at LSH B115LSH B115 | Livingston |
Historical student surveys
Teaching
4.14
Course quality
4.04
Response rate
36.9%
Coverage
66 offerings · 2014–2025
| Instructor | Offerings | Teaching | Quality |
|---|---|---|---|
| Eunjung Noh | 5 | 4.16 | 4.14 |
| Yanwen Luo | 4 | 4.68 | 4.58 |
| Nishali Mehta | 4 | 4.57 | 4.47 |
| Ziming Shi | 4 | 3.75 | 3.72 |
| Naumova Mariya | 4 | 3.55 | 3.33 |
| Kristen Hendricks | 3 | 4.83 | 4.73 |
Catalog and planning context
Credits
3
Current campuses
Livingston
Current availability
7 open of 7
Catalog terms
Fall, Spring, Summer
Core codes
None listed
Loaded terms
6
(01:640:250)<em> OR </em>(01:640:350)<em> OR </em>(21:640:350)
No direct degree-list membership appears in the checked-in requirement index.