What Is Optimization Toolbox?

linprogNote The preprocessing steps are cumulative. For example, even ifyour constraint matrix does not have a row of all zeros to begin with,other preprocessing steps may cause such a row to occur.Once the preprocessing has finished, the iterative part of the algorithmbegins until the stopping criteria are met. (See “Large-Scale LinearProgramming” on page 4-15 for more information about residuals, theprimal problem, the dual problem, and the related stopping criteria.) Iftheresidualsaregrowinginsteadof getting smaller, or the residualsare neither growing nor shrinking, one ofthetwofollowingterminationmessagesisdisplayed,respectively,One or more of the residuals, duality gap, or total relative errorhas grown 100000 times greater than its minimum value so far:orOne or more of the residuals, duality gap, or total relative errorhas stalled:After one of these messages is displayed, it is followed by one of thefollowing six messages indicating that the dual, the primal, or bothappear to be infeasible. The messages differ according to how theinfeasibility or unboundedness was measured.The dual appears to be infeasible (and the primal unbounded).(Theprimal residual < TolFun.)The primal appears to be infeasible (and the dual unbounded). (Thedual residual < TolFun.)The dual appears to be infeasible (and the primal unbounded) sincethe dual residual > sqrt(TolFun).(The primal residual sqrt(TolFun).(The dual residual