Skip to content

Commit 415409c

Browse files
authored
[docs] improve the docstring for DUAL_INFEASIBLE (#2701)
1 parent 078682d commit 415409c

File tree

1 file changed

+9
-7
lines changed

1 file changed

+9
-7
lines changed

src/attributes.jl

Lines changed: 9 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -2123,20 +2123,22 @@ struct ListOfSupportedNonlinearOperators <: AbstractOptimizerAttribute end
21232123
""",
21242124
INFEASIBLE,
21252125
"""
2126-
The algorithm concluded that no dual bound exists for the problem.
2126+
The algorithm proved that no dual feasible solution exists.
21272127
2128-
If the problem is a conic optimization problem (thus also a linear program), this status means the dual
2129-
problem is infeasible.
2128+
To check if the primal problem is feasible, set the objective sense to
2129+
[`FEASIBILITY_SENSE`](@ref) and re-solve the problem.
2130+
2131+
If a primal feasible point does not exist, the original problem is both
2132+
primal and dual infeasible.
21302133
21312134
If a primal feasible solution exists, this status typically implies that the
21322135
problem is unbounded, with some technical exceptions (for example, if the
21332136
problem is a conic optimization problem in which strong duality does not
21342137
hold).
21352138
2136-
To check if the primal is unbounded, set the objective sense to
2137-
[`FEASIBILITY_SENSE`](@ref) and re-solve the problem. If a primal feasible
2138-
point exists, the original problem is unbounded. If a primal feasible point
2139-
does not exist, the original problem is both primal and dual infeasible.
2139+
The technical exceptions do not apply to linear programs. The combination of
2140+
[`DUAL_INFEASIBLE`](@ref) and a primal feasible point means that the primal
2141+
linear program is unbounded.
21402142
""",
21412143
DUAL_INFEASIBLE,
21422144
"""

0 commit comments

Comments
 (0)