2
$\begingroup$

Within my research I found an important doubt and that prevents me from advancing, the context of my doubt is as follows:

We considerer the following optimization problem $$ \left\{\begin{array}{cl} \max\limits_{x\in\mathcal{C}} & f(x) \\[2pt] \text{s.t.} & \mathcal{A}x-b \in K \end{array} \right. \tag{1} $$

where $f:\mathbb{R}^{n}\rightarrow \mathbb{R}$ and $\mathcal{A}:\mathbb{R}^{n}\rightarrow \mathbb{R}^{m}$ are linear functions non-zero, $b\in\mathbb{R}^{m}$, $\mathcal{C}$ is a convex cone in $\mathbb{R}^{n}$ and $K$ is a closed convex cone in $\mathbb{R}^{m}$.

Question: If $\mathcal{C}$ is the convex cone generated by a set $U\subset\mathbb{R}^{n}$, can we say that problem $(1)$ is equivalent to the following problem $$ \left\{\begin{array}{cl} \max\limits_{x\in U} & f(x) \\[2pt] \text{s.t.} & \mathcal{A}x-b \in K \end{array} \right. \tag{2} ?$$

My Idea: My idea is to show that if there is an optimal point $x^{*}\in\mathcal{C}$ for the problem $(1)$ then that point must belong to $U$. The problem is the condition $\mathcal{A}x-b \in K$, I feel that I must put conditions in $ K $ because I see no guarantee that points in $A$ will satisfy the condition, I do not know if I am wrong.

$\endgroup$
  • 1
    $\begingroup$ $n=m=1$, $f(x) = x$, $C = K = (-\infty,0]$, $A = 1$, $b = 0$, $U = \{c\}$ for any $c < 0$.. $\endgroup$ – Hannes Jul 20 '17 at 19:30

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.