A gateway function to MPLP solver (without errorchecks)
R = mpt_call_mplp(S)
S |
Object of the Opt class Class: Opt |
S.H |
Quadratic part of the objective function. Class: double Default: 0 |
S.f |
Linear part of the objective function. Class: double |
S.pF |
Linear part of the objective function for parameters. Class: double Default: 0 |
S.A |
Linear part of the inequality constraints ![]() Class: double |
S.b |
Right hand side of the inequality constraints ![]() Class: double |
S.pB |
Right hand side of the inequality constraints for parameters ![]() Class: double |
S.Ae |
Linear part of the equality constraints ![]() Class: double Default: [] |
S.be |
Right hand side of the equality constraints ![]() Class: double Default: [] |
S.pE |
Right hand side of the equality constraints for parameters ![]() Class: double Default: [] |
S.lb |
Lower bound for the decision variables ![]() Class: double Default: [] |
S.ub |
Upper bound for the decision variables ![]() Class: double Default: [] |
S.Ath |
Linear part of the inequality constraints ![]() Class: double Default: [] |
S.bth |
Right hand side of the inequality constraints ![]() Class: double Default: [] |
S.M |
Linear matrix involved in LCP. Class: double Default: [] |
S.q |
Right hand side vector involved in LCP. Class: double Default: [] |
S.Q |
Linear matrix involved in parametric formulation of LCP. Class: double Default: [] |
S.n |
Number of decision variables. Class: double |
S.d |
Number of parameters. Class: double |
S.m |
Number of inequalities in ![]() Class: double |
S.me |
Number of equalities in ![]() Class: double |
S.problem_type |
A string specifying the problem to be solved Class: char Default: [] |
S.varOrder |
Order of variables if the problem was processed by YALMIP first. Class: double Default: [] |
S.Internal |
Internal property of Opt class. Class: struct Default: [] |
S.recover |
Affine map for MPLP problems if there were any equalities present and have been removed by eliminateEquations method. Class: struct |
S.recover.Y |
Matrix of the affine map ![]() ![]() Class: double Default: [] |
S.recover.th |
Matrix of the affine map ![]() ![]() Class: double Default: [] |
R |
result structure Class: struct |
R.xopt |
Optimal solution Class: PolyUnion |
R.mplpsol |
Structure with the solution as returned by MPLP solver. Class: struct |
R.mplpsol.Pn |
Array of polytopes in MPT2 format. Class: polytope |
R.mplpsol.Fi |
Cell array of matrices of the control law given as ![]() Class: cell |
R.mplpsol.Gi |
Cell array of matrices of the control law given as ![]() Class: cell |
R.mplpsol.activeConstraints |
Index set of active constraints Class: cell |
R.mplpsol.Phard |
Feasible domain. Class: polytope |
R.mplpsol.details |
More details about the solution and the computation. Class: struct |
◀ | mpt_solve | mpt_call_plcp | ▶ |
© 2010-2013 Martin Herceg: ETH Zurich, herceg@control.ee.ethz.ch