Global multi-parametric optimal value bounds and solution estimates for separable parametric programs
From MaRDI portal
Recommendations
- Global optimization issues in multiparametric continuous and mixed-integer optimization problems
- Computable bounds on parametric solutions of convex problems
- A global optimization method for nonconvex separable programming problems
- A novel approach for solving multi-parametric problems with nonlinear constraints
- An Algorithm for Separable Nonconvex Programming Problems
Cites work
- scientific article; zbMATH DE number 3898606 (Why is no real title available?)
- scientific article; zbMATH DE number 3748729 (Why is no real title available?)
- scientific article; zbMATH DE number 3764622 (Why is no real title available?)
- Algorithms for parametric nonconvex programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convexity and concavity properties of the optimal value function in parametric nonlinear programming
- Generalized convexity and concavity of the optimal value function in nonlinear programming
- Generalized equations and their solutions, Part I: Basic theory
- Inequalities for Stochastic Nonlinear Programming Problems
- Introduction to sensitivity and stability analysis in nonlinear programming
- Sensitivity Analysis Procedures for Geometric Programs: Computational Aspects
- Sensitivity analysis in posynomial geometric programming
- Solving highly nonlinear convex separable programs using successive approximation
- Stability of the solution of definite quadratic programs
- Strongly Regular Generalized Equations
Cited in
(2)
This page was built for publication: Global multi-parametric optimal value bounds and solution estimates for separable parametric programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804476)