A gateway function to solve parametric optimization problems (without errorchecks)
R = mpt_solvemp(S)
S |
Object of the Opt class Class: Opt |
S.H |
Quadratic part of the objective function. Class: double Default: [] |
S.f |
Linear part of the objective function. Class: double |
S.pF |
Linear part of the objective function for parameters. Class: double Default: [] |
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.vartype |
A string array reserved for MPMILP/MPMIQP. Class: char Default: '' |
S.solver |
S string specifying which solver should be called. Class: char Default: [] |
S.isParametric |
Logical scalar indicating that the problem is parametric. Class: double or logical Default: 1 |
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/MPQP problems after transformation to LCP. Class: struct |
S.recover.uX |
Matrix of the affine map ![]() ![]() Class: double Default: [] |
S.recover.uTh |
Matrix of the affine map ![]() ![]() Class: double Default: [] |
S.recover.lambdaX |
Matrix of the affine map ![]() ![]() Class: double Default: [] |
S.recover.lambdaTh |
Matrix of the affine map ![]() ![]() Class: double Default: [] |
R |
result structure Class: struct |
R.xopt |
Optimal solution with the associated functions for optimizer, multipliers and the objective value. Class: PolyUnion |
R.exitflag |
An integer value that informs if the result was feasible (1), or otherwise (different from 1) Class: double |
R.how |
A string that informs if the result was feasible ('ok'), or if any problem appeared through optimization Class: char |
R.solveTime |
Information about the time that elapsed during the computation in seconds. Class: double |
R.stats |
Further details from the parametric solver. Class: struct |
◀ | mpt_call_cplex | mpt_call_quadprog | ▶ |
© 2010-2013 Martin Herceg: ETH Zurich, herceg@control.ee.ethz.ch