ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PaP_a and PbP_b be optimization problems such that one is the dual of the other, so that they exhibit strong duality. Strong-duality polynomial-solvability conjecture. Both PaP_a and PbP_b should be polynomially solvable. This conjecture is motivated by the canonical dual examples discussed in the paper, where strong duality and polynomial-time solution coexist; its general validity is not established here.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.