HUNTERTUTORING

Optimization & linear programming

Undergraduate · Math

Syllabus focus

Standard syllabus · STEM / applied

Pricing calculator

Choose materials, tutoring, or both — or book a single session as needed. Customize your plan on the subscribe page.

What do you need?

$1,162 · Optimization & linear programming · 18 tutoring hrs

Study guides, worksheets, reviews, practice tests, and answer keys for 1 class. 18 tutoring hours (1 hr / week · semester). Bundle discount applied vs buying separately. Pay in full via Zelle or Venmo.

Topics typically covered

Standard syllabus

Linear programming

  • Linear programming problems: standard form and geometry
  • Feasible regions, vertices, and the fundamental theorem of LP
  • Simplex method: pivoting, optimality, and termination
  • Duality: weak and strong duality (statements)
  • Sensitivity analysis and shadow prices (introduction)

Nonlinear optimization

  • Unconstrained optimization: critical points and convexity
  • Gradient descent and Newton's method for multivariable functions
  • Constrained optimization: Lagrange multipliers
  • Karush–Kuhn–Tucker (KKT) conditions (introduction)
  • Convex sets and convex functions (definitions and examples)

Discrete and network optimization

  • Integer programming and branch-and-bound (overview)
  • Transportation and assignment problems
  • Shortest path and minimum spanning tree problems
  • Network simplex (introduction)
  • Multi-objective optimization and Pareto efficiency (brief)

STEM / applied

Applications and software

  • Production planning and resource allocation models
  • Portfolio optimization (Markowitz model, introduction)
  • Scheduling and blending problems in industry
  • Solver use in Excel, Python (SciPy), or GAMS
  • Case studies in logistics and supply chain

Algorithms and computation

  • Interior-point methods (conceptual overview)
  • Quadratic programming applications
  • Nonlinear least squares and curve fitting
  • Heuristic methods: simulated annealing and genetic algorithms (intro)
  • Robustness and infeasibility diagnosis in large models

Notes

Topics reflect common optimization and linear programming syllabi at US colleges and universities. Some programs emphasize OR/IE applications; others focus on the mathematical foundations of convex optimization.