File tree 1 file changed +9
-7
lines changed
1 file changed +9
-7
lines changed Original file line number Diff line number Diff line change @@ -2123,20 +2123,22 @@ struct ListOfSupportedNonlinearOperators <: AbstractOptimizerAttribute end
2123
2123
""" ,
2124
2124
INFEASIBLE,
2125
2125
"""
2126
- The algorithm concluded that no dual bound exists for the problem .
2126
+ The algorithm proved that no dual feasible solution exists .
2127
2127
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.
2130
2133
2131
2134
If a primal feasible solution exists, this status typically implies that the
2132
2135
problem is unbounded, with some technical exceptions (for example, if the
2133
2136
problem is a conic optimization problem in which strong duality does not
2134
2137
hold).
2135
2138
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.
2140
2142
""" ,
2141
2143
DUAL_INFEASIBLE,
2142
2144
"""
You can’t perform that action at this time.
0 commit comments