Which are the most famous problems having an objective of

Logan Lamb

Logan Lamb

Answered question

2022-05-08

Which are the most famous problems having an objective of maximizing a nonlinear convex function (or minimizing a concave function)? As far as I know such an objective with respect to linear constraints is np-hard.

Answer & Explanation

garcialdariamcy4q

garcialdariamcy4q

Beginner2022-05-09Added 15 answers

THE most famous problem having an objective of maximizing a convex function (or minimizing a concave function), and having linear constraints, is Linear Programming, which is NOT np-hard.

Linear Programming is both a convex optimization problem (minimizing a convex function subject to convex constraints) and a concave optimization problem (minimizing a concave function subject to convex constraints). Therefore it has all the properties of both, to include, all local optima are global optima, and if the constraints are compact (bounded), then there is a global optimum at the extreme of the constraints.

Do you have a similar question?

Recalculate according to your conditions!

New Questions in High school geometry

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?