Pages that link to "Item:Q1106102"
From MaRDI portal
The following pages link to Computable bounds on parametric solutions of convex problems (Q1106102):
Displaying 7 items.
- Global optimization of multi-parametric MILP problems (Q842719) (← links)
- An algorithm for approximate multiparametric convex programming (Q853676) (← links)
- Characterizing optimality in mathematical programming models (Q1108200) (← links)
- Variable target value subgradient method (Q1174455) (← links)
- On parametric nonlinear programming (Q2276886) (← links)
- Suggested research topics in sensitivity and stability analysis for semi- infinite programming problems (Q2276890) (← links)
- Sensitivity and stability analysis for nonlinear programming (Q2639776) (← links)
