Mathematics- Optimization Techniques-

Linear Programming (LP)- Standard Form LP, Canonical Form LP, Transportation LP, Assignment LP, Network LP, Integer LP (ILP), Mixed Integer LP (MILP), Bounded Variables LP, Unbounded LP, Infeasible LP, Degenerate LP.

Nonlinear Programming (NLP)- Unconstrained Nonlinear Programming (UNLP), Constrained Nonlinear Programming (CNLP), Linearly Constrained Nonlinear Programming (LCNLP), Quadratic Programming (QP), Convex and Nonconvex Nonlinear Programming, Global and Local Optimization, Stochastic Nonlinear Programming, Dynamic Nonlinear Programming (DNLP).

Convex Optimization- Linear Programming (LP), Quadratic Programming (QP), Second-Order Cone Programming (SOCP), Semidefinite Programming (SDP), Convex Quadratic Optimization, Convex Conic Optimization, Nonlinear Convex Optimization, Geometric Programming, Non-negative Matrix Factorization (NMF), Robust Convex Optimization.

Integer Programming (IP)- Binary Integer Programming (BIP), Integer Linear Programming (ILP), Mixed Integer Linear Programming (MILP), Mixed Integer Nonlinear Programming (MINLP), Integer Quadratic Programming (IQP), Pure Integer Programming (PIP), Zero-One Integer Programming (ZOIP), Semi-continuous Integer Programming, Semi-integer Programming, Network Design and Flow Models.

Dynamic Programming- Tabulation (Bottom-Up DP), Memoization (Top-Down DP), Optimization Problems, Counting Problems, Decision Making Problems, String Problems, Space Optimization, Bitmask DP, Tree/Graph DP, Two-Pointer DP.

Heuristic and Metaheuristic Methods- Greedy Heuristic, Constructive Heuristic, Local Search Heuristic, Randomized Heuristic, Simulated Annealing, Genetic Algorithms (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), Tabu Search, Iterated Local Search (ILS), Simulated Annealing, Variable Neighborhood Search (VNS), Harmony Search (HS), Differential Evolution (DE), Firefly Algorithm.

Stochastic Optimization- Stochastic Linear Programming (SLP), Stochastic Integer Programming (SIP), Stochastic Dynamic Programming (SDP), Stochastic Network Optimization, Chance-Constrained Programming (CCP), Robust Optimization, Simulation-based Optimization, Multi-Stage Stochastic Programming, Stochastic Control, Stochastic Gradient Descent (SGD).

Multi-objective Optimization- Weighted Sum Method, Pareto-Based Methods, Evolutionary Algorithms, Scalarization Techniques, Constraint Handling Methods, Preference-based Methods, Interactive Methods, Hybrid Methods, Adaptive Methods, Surrogate-based Methods, MOEA (Multi-Objective Evolutionary Algorithms), Decomposition-based Methods.

Robust Optimization- Robust Linear Optimization (RLO), Robust Integer Programming (RIP), Robust Convex Optimization, Distributionally Robust Optimization (DRO), Robust Semidefinite Programming (SDP), Chance-constrained Optimization, Stochastic Programming, Interval Optimization, Robust Multi-objective Optimization, Robust Control Theory.

Constraint Programming- Finite Domain Constraint Programming (FD-CP), Continuous Constraint Programming (CC-CP), Interval Constraint Programming (ICP), Global Constraints, Constraint Satisfaction Problems (CSP), Constraint Optimization Problems (COP), Temporal Constraint Programming, Symmetry Breaking, Meta-heuristic Methods with CP, Hybrid Approaches.

Combinatorial Optimization- Traveling Salesman Problem (TSP), Knapsack Problem, Graph Coloring, Maximum Cut, Bin Packing Problem, Job Scheduling, Vehicle Routing Problem (VRP), Network Design, Facility Location, Set Covering.