21 problems

Robust flow model gap conjecture
arXiv@arxiv
Robust flow gap conjecture. For any $\Gamma\in\mathbb{N}$ , the inequalities
Conjectureopennetwork-flows robust-optimization
1
Polynomial-time solvability conjecture for multi-representative selection with bounded representatives
arXiv@arxiv
Polynomial-time solvability conjecture. In this setting, the problem can be solved in polynomial time by extending the arguments from Section 6.
Conjectureopencomputational-complexity robust-optimization selection-problems
0
Conjecture on the minimax value for bundling beyond finite variance
arXiv@arxiv
Let $\mu$ and $d$ satisfy … Let $\mathcal{P}(\mu,d)$ be the ambiguity set of non-negative distributions with mean $\mu$ and mean absolute deviation $d$ . The minimax problem conside…
Conjectureopenbundling mechanism-design robust-optimization
0
Conjecture on the endpoint polyhedron of a one-parameter family
arXiv@arxiv
Endpoint-emptiness conjecture. The polyhedron $P(csigma_P(\lambda))$ must be empty.
Conjectureopencomputational-geometry convex-polyhedra robust-optimization
1
Conjecture on unbounded root relaxation for RGUP KKT-based formulations
arXiv@arxiv
Let the RGUP constraints be the constraints presented in Appendix. Unbounded-relaxation conjecture. The result of Lemma holds for these RGUP constraints. The observed unbounded roo…
Conjectureopenbilevel-optimization mixed-integer-optimization robust-optimization
0
Conjecture on extending finite-adaptability tractability to any number of stages
arXiv@arxiv
Finite-adaptability tractability conjecture. These theorems can be extended to any $k$ .
Conjectureopendiscrete-geometry polynomial-optimization robust-optimization
0
The NFM strong-node containment conjecture for ℓ₂-norm-diag
arXiv@arxiv
NFM strong-node containment conjecture. With probability not converging to $0$ as $n\to\infty$ , $\ell_2$ -norm-diag returns exactly $k$ disjoint clusters $V_1',\dots,V_k'$ such that…
Conjectureopencommunity-detection correlation-clustering robust-optimization
1
Kernel-based uncertainty-set conjecture for system identification
arXiv@arxiv
The estimation methods RLS, SRLS, and KRLS are compared, where the uncertainty set in each method represents possible disturbances or model uncertainty in the system-identification…
Conjectureopenkernel-methods robust-optimization system-identification
0
The complexity-hierarchy conjecture for two-stage discrete uncertainty
arXiv@arxiv
Complexity-hierarchy conjecture. The two-stage setting proposed here with a variant of two-stage discrete uncertainty moves up one level in the complexity hierarchy, and problems b…
Conjectureopencomputational-complexity discrete-optimization robust-optimization
0
The RNC hierarchy conjecture for the easiness of 2S-RecovAP
arXiv@arxiv
RNC hierarchy conjecture. The complexity class
Conjectureopencomplexity-theory robust-optimization
1
Conjecture on improving the constant 2 in the meta-algorithm's running time
arXiv@arxiv
The paper studies robust combinatorial optimization with locally budgeted uncertainty, where the uncertainty set is formed by assigning local budgets to groups of uncertain coeffic…
Conjectureopencombinatorial-optimization parameterized-complexity robust-optimization
0
Conjecture on robustness to imperfect RIS phase tuning
arXiv@arxiv
Robustness conjecture. Due to the large number of RIS elements, the system performance is often robust against the imperfect phase tuning of individual elements.
Conjectureopenreconfigurable-intelligent-surfaces robust-optimization wireless-communications
0
Conjecture on pooling units with higher variability in nurse pool design
arXiv@arxiv
Higher-variability pooling conjecture. An optimal design tends to pool together units with higher variability, namely units with higher standard deviation in demand and/or higher a…
Conjectureopennurse-staffing operations-research robust-optimization
0
Conjecture that interval uncertainty cannot generally be reduced to the certain bilevel problem
arXiv@arxiv
Consider bilevel optimization problems with interval uncertainty in the follower's objective coefficients. Interval-reduction conjecture. In general, the interval case cannot be re…
Conjectureopenbilevel-optimization continuous-knapsack robust-optimization
0
The weak-correlation conjecture for individual ellipsoids in robust optimization
arXiv@arxiv
Weak-correlation conjecture. If the correlations among the data for the individual constraints are weak, one should use individual ellipsoids that are later aggregated.
Conjectureopenrobust-optimization uncertainty-quantification
0
Seller's adversarial allocation conjecture for cash-settled electricity options
arXiv@arxiv
Seller's adversarial allocation conjecture. The seller conjectures that $M$ chooses the allocation adversarially, minimizing her scenario payoff, so that
Conjectureopenelectricity-markets financial-options robust-optimization
0
Conjecture on grid aspect ratio and heuristic bound performance
arXiv@arxiv
Consider grid digraph instances for the interval data min-max regret shortest path problem, and compare the bounds produced by the LPH and AMU procedures. Grid-balance conjecture.…
Conjectureopencombinatorial-optimization robust-optimization shortest-path-problems
0
Conjecture on valid bounds for compact-constraint interval min-max regret problems
arXiv@arxiv
Let an interval data min-max regret problem have a compact constraint set, and consider the heuristic framework described for interval min-max regret problems. Validity-bounds conj…
Conjectureopencombinatorial-optimization min-max-regret robust-optimization
0
Barycenter conjecture for the point of tangency of linear outer approximations
arXiv@arxiv
Barycenter conjecture. In higher dimensions, the point of tangency is the barycenter of $U$ .
Conjectureopenmultiobjective-optimization pareto-sets robust-optimization
1
Feasibility of the differential-game approach to robust utility maximization
arXiv@arxiv
Differential-game feasibility conjecture. The alternative approach via differential games is also feasible.
Conjectureopendifferential-games robust-optimization stochastic-control
1
Conjecture that the robust growth-optimal measure belongs to the admissible class
arXiv@arxiv
Let $\eta^*\in H_{\lambda^*}$ and let $(\mathbb{P}^*_x)_{x\in \widehat{E}}$ solve the generalized martingale problem on $\widehat{E}$ for the operator $L^{\eta^*}$ , and set…
Conjectureopenmathematical-finance robust-optimization stochastic-processes
0