Mathematical Optimization

Mathematical Optimization#

Resources#

https://en.wikipedia.org/wiki/Category:Optimization_algorithms_and_methods

https://en.wikipedia.org/wiki/Category:Mathematical_optimization_software

https://en.wikipedia.org/wiki/List_of_optimization_software

Texts#

2006 V. Jeyakumar & Alexander M. Rubinov. Continuous Optimization: Current Trends and Modern Applications. Springer Science & Business Media.

Figures#

  • [ w ] 1920-1984 Bellman, Richard

  • [ w ] 1950----- Cornuéjois, Gérard

  • [ w ] 1929----- Gomory, Ralph

  • [ w ] 1912-1986 Kantorovich, Leonid

  • [ w ] 1736-1813 Lagrange, Joseph-Louis

  • [ w ] 1903-1957 Von Neumann, John

  • [ w ] 1920-2020 Zalgaller, Victor

Terms#

  • [ w ] Algorithm, Hungarian

  • [ w ] Algorithmic Mechanism Design

  • [ w ] arg max

  • [ w ] arg min

  • [ w ] Bender’s Decomposition

  • [ w ] Branch and Bound

  • [ w ] Branch and Cut

  • [ w ] Broyden-Fletcher-Goldfarb-Shanno (BFGS) Algorithm

  • [ w ] Charging Argument

  • [ w ] Combinatorial Optimization

  • [ w ] Configuration Linear Program

  • [ w ] Constraint

  • [ w ] Continuous Optimization

  • [ w ] Cost Function (Loss Function, Objective Function)

  • [ w ] Contour Line

  • [ w ] Cutting Stock Problem

  • [ w ] Cutting-Plane Method

  • [ w ] Design Optimization

  • [ w ] Deterministic Global Optimization

  • [ w ] Discrete Optimization

  • [ w ] Duality

  • [ w ] Ekeland’s Variational Principle

  • [ w ] Extrema

  • [ w ] Hungarian Algorithm

  • [ w ] Karush-Kuhn-Tucker (KKT) Conditions

  • [ w ] Knapsack Problem

  • [ w ] Lagrange Multiplier

  • [ w ] Lagrangian Relaxation

  • [ w ] Line, Contour

  • [ w ] Line Search

  • [ w ] Loss Function (Cost Function, Objective Function)

  • [ w ] Mathematical Optimization

  • [ w ] Maxima

  • [ w ] Maximum Theorem

  • [ w ] Method, Cutting-Plane

  • [ w ] Method, Subgradient

  • [ w ] Minima

  • [ w ] Objective Function (Loss Function, Cost Function)

  • [ w ] Optimization, Combinatorial

  • [ w ] Optimization, Continuous

  • [ w ] Optimization, Deterministic Global

  • [ w ] Optimization, Design

  • [ w ] Optimization, Discrete

  • [ w ] Optimization, Mathematical

  • [ w ] Optimization, Process

  • [ w ] Optimization, Simulation-Based

  • [ w ] Optimization Problem

  • [ w ] Pattern Search

  • [ w ] Problem, Cutting Stock

  • [ w ] Problem, Knapsack

  • [ w ] Problem, Optimization

  • [ w ] Problem, Vehicle Routing

  • [ w ] Process Optimization

  • [ w ] Profit Maximization

  • [ w ] Saddle Point

  • [ w ] Satisficing

  • [ w ] Search, Line

  • [ w ] Search, Pattern

  • [ w ] Search, Tabu

  • [ w ] Simulation-Based Optimization

  • [ w ] Subderivative

  • [ w ] Subgradient Method

  • [ w ] Tabu Search

  • [ w ] test functions for optimization

  • [ w ] Trust Region

  • [ w ] Value Function

  • [ w ] Vehicle Routing Problem

  • [ w ] Constraint Programming

  • [ w ] Dynamic Programming

  • [ w ] Goal Programming

  • [ w ] Integer Programming

  • [ w ] Linear Programming

  • [ w ] Programming, Constraint

  • [ w ] Programming, Dynamic

  • [ w ] Programming, Goal

  • [ w ] Programming, Integer

  • [ w ] Programming, Linear

  • [ w ] Programming, Semi Infinite (SIP)

  • [ w ] Programming, Quadratic

  • [ w ] Programming, Sequential Quadratic

  • [ w ] Programming, Stochastic

  • [ w ] Quadratic Programming

  • [ w ] Quadratic Programming, Sequential

  • [ w ] Semi Infinite Programming (SIP)

  • [ w ] Sequential Quadratic Programming

  • [ w ] Stochastic Programming

  • [ w ] Operations Research

  • [ w ] Makespan

  • [ w ] Descent Direction

  • [ w ] Gradient Descent

scheduling

  • [ w ] Crew Scheduling

  • [ w ] Driver Scheduling Problem

  • [ w ] Earliest Deadline First

  • [ w ] Fernandez’ Method

  • [ w ] Identical-Machines Scheduling

  • [ w ] Interval Scheduling

  • [ w ] Job Scheduling, Optimal

  • [ w ] Job Scheduling, Truthful

  • [ w ] Job-Shop Scheduling

  • [ w ] List Scheduling

  • [ w ] Longest-Processing-Time-First Scheduling

  • [ w ] Optimal Job Scheduling

  • [ w ] Preferential Bidding System

  • [ w ] Problem, Driver Scheduling

  • [ w ] Scheduling

  • [ w ] Scheduling, Crew

  • [ w ] Scheduling, Identical-Machines

  • [ w ] Scheduling, Interval

  • [ w ] Scheduling, Job-Shop

  • [ w ] Scheduling, List

  • [ w ] Scheduling, Longest-Processing-Time-First

  • [ w ] Scheduling, Single-Machine (Single-Resource)

  • [ w ] Scheduling, Single-Resource (Single-Machine)

  • [ w ] Scheduling, Uniform-Machines

  • [ w ] Single-Machine Scheduling (Single-Resource Scheduling)

  • [ w ] Single-Resource Scheduling (Single-Machine Scheduling)

  • [ w ] Tardiness

  • [ w ] Truthful Job Scheduling

  • [ w ] Uniform-Machines Scheduling

bin packing

  • [ w ] Bin Packing, First-Fit-Decreasing

  • [ w ] Bin Packing, High-Multiplicity

  • [ w ] Bin Packing, Next-Fit

  • [ w ] Bin Packing Problem

  • [ w ] First-Fit-Decreasing Bin Packing

  • [ w ] High-Multiplicity Bin Packing

  • [ w ] Next-Fit Bin Packing

  • [ w ] Problem, Bin Packing

partitioning

  • [ w ] Algorithm, Multifit

  • [ w ] Critical Path Method

  • [ w ] Greedy Number Partitioning

  • [ w ] Multifit Algorithm

  • [ w ] Multiway Number Partitioning

  • [ w ] Partition Problem

  • [ w ] Problem, Partition

  • [ w ] Problem, Subset Sum

  • [ w ] Subset Sum Problem

fair division

  • [ w ] Divide and Choose

  • [ w ] Envy-Freeness

  • [ w ] Fair Division

  • [ w ] Fair Item Allocation

  • [ w ] Maximin Share

  • [ w ] Preference

Contents