Oldest pages

Jump to navigation Jump to search

Showing below up to 20 results in range #21 to #40.

View ( | ) (20 | 50 | 100 | 250 | 500)

  1. Mixed-integer linear fractional programming (MILFP)‏‎ (07:38, 21 December 2020)
  2. Fuzzy programming‏‎ (07:40, 21 December 2020)
  3. Convex generalized disjunctive programming (GDP)‏‎ (07:40, 21 December 2020)
  4. Adaptive robust optimization‏‎ (07:41, 21 December 2020)
  5. Stochastic gradient descent‏‎ (07:41, 21 December 2020)
  6. Duality‏‎ (10:44, 4 September 2021)
  7. Simplex algorithm‏‎ (08:26, 5 October 2021)
  8. Local branching‏‎ (19:42, 18 October 2021)
  9. Bellman equation‏‎ (17:14, 28 November 2021)
  10. Interior-point method for NLP‏‎ (09:49, 7 December 2021)
  11. Geometric programming‏‎ (15:40, 11 December 2021)
  12. McCormick envelopes‏‎ (08:21, 12 December 2021)
  13. Branch and bound for MINLP‏‎ (21:56, 14 December 2021)
  14. AdaGrad‏‎ (22:03, 14 December 2021)
  15. Exponential transformation‏‎ (00:06, 15 December 2021)
  16. Optimization in game theory‏‎ (12:02, 15 December 2021)
  17. Piecewise linear approximation‏‎ (16:29, 15 December 2021)
  18. Job shop scheduling‏‎ (16:46, 15 December 2021)
  19. Mathematical programming with equilibrium constraints‏‎ (17:10, 15 December 2021)
  20. Momentum‏‎ (20:24, 15 December 2021)

View ( | ) (20 | 50 | 100 | 250 | 500)

Retrieved from "https://optimization.cbe.cornell.edu/index.php?title=Special:AncientPages"