1
$\begingroup$

Considering an optimization problem in which the objective function is linear and the feasible region is a non-convex set: Can we assure that the global optima is still in the frontier of the feasible region? Any proof or counterexample?

I have thought about it, and I would say this holds considering an objective function $f: \mathbb{R}^{2} \rightarrow \mathbb{R}$. However, I do not know if this is true or if it can be generalized.

Maybe this is a very naive question, but I could not find any resource clarifying this.

Thank you in advance for your comments. Best regards.

$\endgroup$
3
  • 1
    $\begingroup$ No. Any non-convex optimization problem can be put in this form via epigraph formulation. Change minimize objective subject to constraints; to minimize t subject to objective <= t and original constraints. This now has your "special" form. $\endgroup$ Jul 28, 2022 at 17:02
  • 1
    $\begingroup$ Hello Mark. You are right, I could estate the problem as you suggest so that the new formulation satifies my conditions. However, in that specific form, the global optima will be in the frontier given that the constraint: objective <= t will be active. $\endgroup$ Jul 29, 2022 at 6:39
  • $\begingroup$ I have been thinking about this a little bit more and I would say it is true. Intuitively, if the feasible region is compact and the objective function is linear, the gradient of the objective function won't be null in the interior of the feasible region. Therefore, the global optima lays in the frontier necessarily. However, in pretty fresh in this field and I can still be totally wrong. Anyway, I truly appreciate your comments. Best regards. $\endgroup$ Jul 29, 2022 at 6:48

1 Answer 1

1
$\begingroup$

I assume by "frontier" you mean boundary. Let's assume we are maximizing $f(x)=c^\prime x$ over $X\subseteq \mathbb{R}^n,$ with $c\neq 0.$

Suppose that $X$ has full dimension $n$ and $x$ is a point in the interior of $X.$ Then $x\in B \subseteq X$ for some nontrivial ball $B$, and that ball must contain $x+\lambda c$ for some $\lambda > 0.$ Since $f(x+\lambda c)=c^\prime x + \lambda \left\Vert c \right\Vert^2 > c^\prime x,$ $x$ cannot be a maximum. So the maximum, if one exists, must lie on the boundary of $X.$

Now suppose instead that $X$ has dimension less than $n,$ meaning it is contained in an affine subspace of dimension $d<n.$ Then the interior of $X$ is empty, and technically the boundary of $X$ is $X,$ meaning any maximum is automatically a boundary point. I suspect, though, that you are interested in the relative boundary (the complement in $X$ of the relative interior of $X$). Project $c$ into the affine subspace containing $X.$ If the projection is 0, $f(x)$ is constant over $X$ and every point of $X,$ whether in the relative interior or the relative boundary, is a maximum. If the projection is not 0, apply the previous argument (using the projection of $c$ and a ball of dimension $d$ in the relative interior of $X$) to rule out the possibility of a relative interior point being a maximum.

Note that, without additional assumptions, there is no guarantee that $X$ has a boundary (or, more precisely, that its boundary belongs to it), nor any guarantee that a maximum exists.

$\endgroup$
3
  • $\begingroup$ Your assumptions in regards to what I mean are right. Next time, I will be much more precise in my explanations and assumptions. You formalized all concepts, arguments, and exceptions I thought about. Therefore, first, I would like to say that I fully agree with you. Secondly, I enormously appreciate your comments and help. Summing your comment up, if I undertood you correctly, we could then say: "Given an optimization problem in which the objective function is linear. If the global optima exist, it can be found on the boundary of the feasible set". $\endgroup$ Aug 1, 2022 at 8:40
  • $\begingroup$ Also, I would like to know the best solvers for this kind of problem. I have seen that the SLP (Successive Linear Programming) algorithm is commonly used to solve optimization problems in which the objective function is linear and the feasible set is non-convex. This is a separate discussion though. If you are interested in discussing it, I will create a separate post to address it. Thank you very much. Best regards. $\endgroup$ Aug 1, 2022 at 8:40
  • $\begingroup$ I agree with the conclusion that, if the optimum exists, at least one boundary point is optimal. Regarding the new question, I will not be much help (I typically stick to problems with convex feasible regions, at least if you relax integrality), but there are other people here who could provide useful answers ... and I agree that it should be posted as a separate question. $\endgroup$
    – prubin
    Aug 1, 2022 at 15:00

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .