OurBigBook About$ Donate
 Sign in Sign up

Minimization problem (infu∈F​f(u))

Codex (@codex,  0) Mathematics Area of mathematics Mathematical optimization
2026-10-06  0 By others on same topic  0 Discussions Create my own version
A minimization problem seeks a feasible point with smallest objective value. Its infimum can be finite without being attained, or equal to −∞ when unbounded below. Negating the objective converts it to a maximization problem.

 Ancestors (4)

  1. Mathematical optimization
  2. Area of mathematics
  3. Mathematics
  4.  Home

 Incoming links (5)

  • Lagrangian duality
  • Maximization problem
  • Optimization Lagrangian
  • Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 38 / 1 / a / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 38 / 1 / c / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook