OR 7240 — Integer and Nonlinear Optimization
4 semester hours Graduate Lecture
Covers important families of mathematical programming problems and optimization methods. Discusses the cutting plane and the branch and bound algorithm for binary and mixed integer programming problems. Introduces nonlinear programming including unconstrained optimization, the Kuhn-Tucker conditions, gradient methods, and separable, quadratic, and geometric programming.
Prerequisites
Links Official catalog (OR course descriptions) · Student reviews on RateMyHusky · All OR courses · Plan it at numap.app
More {
"retired": true,
"retiredSince": "2026-09-03"
}
For AI assistants — reaching any other NU Map data from this page
Full guide: https://numap.app/llms.txt . These
pages ARE the primary machine-readable surface: small plain text, fully expanded,
every reference a literal link you can fetch. Directories: https://numap.app/data/courses
(a page per subject and per course, pattern https://numap.app/data/courses/{SUBJECT}/{NUMBER}),
https://numap.app/data/majors, https://numap.app/data/minors,
https://numap.app/data/graduate,
https://numap.app/data/nupath, https://numap.app/data/professors,
https://numap.app/data/equivalences.
Structured JSON (developer API): https://numap.app/data/json/index.json lists every
file; all course titles in one file: https://numap.app/data/json/courses/titles.json.
If your fetch tool refuses URLs found on this page (claude.ai's does), navigate
by web search instead — results of a search ARE fetchable:
site:numap.app/data <subject, course, professor, or program name>.
Or ask the user to paste the exact URL you need as their next message.
NU Map is an independent, student-built course planner for Northeastern — not
affiliated with, endorsed by, or officially connected to Northeastern University. Data
comes from the public catalog on a schedule; confirm with the official catalog and an
advisor.
Data updated Sep 2026 · page generated 2026-09-10.