If are feasible points and , concavity gives
(1)
for every . Thus the feasible set is a convex set. Since the objective function is convex, this is a convex optimization problem.

Ancestors (12)

  1. a
  2. 3
  3. 2025
  4. Past exam of the continuous optimisation course of the University of Oxford
  5. Continuous optimisation course of the University of Oxford
  6. Year 4 of the mathematics course of the University of Oxford
  7. Mathematics course of the University of Oxford
  8. Undergraduate course of the University of Oxford
  9. Course of the University of Oxford
  10. University of Oxford
  11. List of universities
  12. Home

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