Skip to main content
removed capitals from title (the question was bumped anyway), added tag
Link
YCor
  • 63.9k
  • 5
  • 187
  • 285

Rational Combinatorial Optimization Problemcombinatorial optimization problem

What is the complexity of and how to go about solving the following task:
given?

Given $$a,b\in\mathbb{R}_+^n,\ n\ge k\in\mathbb{N}$$ find$a, b \in \mathbb{R}_+^n$ and $$x_{min} \ :=\ \min_{x\in\lbrace0,1\rbrace^n,\ x^Tx=k}\frac{x^Ta}{x^Tb} $$$n \ge k\in\mathbb{N}$, find

$$ x_{\min} := \arg \min_{x \in \lbrace 0,1 \rbrace^n, x^T x = k} \frac{x^Ta}{x^Tb} $$

What is the complexity of and how to go about solving the following task:
given $$a,b\in\mathbb{R}_+^n,\ n\ge k\in\mathbb{N}$$ find $$x_{min} \ :=\ \min_{x\in\lbrace0,1\rbrace^n,\ x^Tx=k}\frac{x^Ta}{x^Tb} $$

What is the complexity of and how to go about solving the following task?

Given $a, b \in \mathbb{R}_+^n$ and $n \ge k\in\mathbb{N}$, find

$$ x_{\min} := \arg \min_{x \in \lbrace 0,1 \rbrace^n, x^T x = k} \frac{x^Ta}{x^Tb} $$

followed suggestion in comments to emphasise that k is a cardinality constraint
Source Link
Manfred Weis
  • 13.2k
  • 4
  • 34
  • 76

What is the complexity of and how to go about solving the following task:
given $$a,b\in\mathbb{R}_+^n$$$$a,b\in\mathbb{R}_+^n,\ n\ge k\in\mathbb{N}$$ find $$x_{min} \ :=\ \min_{x\in\lbrace0,1\rbrace^n,\ x^Tx=k\le n}\frac{x^Ta}{x^Tb} $$$$x_{min} \ :=\ \min_{x\in\lbrace0,1\rbrace^n,\ x^Tx=k}\frac{x^Ta}{x^Tb} $$

What is the complexity of and how to go about solving the following task:
given $$a,b\in\mathbb{R}_+^n$$ find $$x_{min} \ :=\ \min_{x\in\lbrace0,1\rbrace^n,\ x^Tx=k\le n}\frac{x^Ta}{x^Tb} $$

What is the complexity of and how to go about solving the following task:
given $$a,b\in\mathbb{R}_+^n,\ n\ge k\in\mathbb{N}$$ find $$x_{min} \ :=\ \min_{x\in\lbrace0,1\rbrace^n,\ x^Tx=k}\frac{x^Ta}{x^Tb} $$

Source Link
Manfred Weis
  • 13.2k
  • 4
  • 34
  • 76
Loading