Technical Note—A Duality Theory for Convex Programming with Set-Inclusive Constraints
From MaRDI portal
Cited in
(36)- Wolfe duality for interval-valued optimization
- Relaxed robust second-order-cone programming
- Duality in inexact fractional programming with set-inclusive constraints
- Objective function bounds for the inexact linear programming problem with generalized cost coefficients
- On some optimization problems under uncertainty
- Convex programming with set-inclusive contraints and its applications to generalized linear and fractional programming
- Inexact linear programming with generalized resource sets
- Intuitionistic fuzzy linear programming and duality: a level sets approach
- Continuous time programming with set-inclusive constraints and objective set
- Satisficing solutions and duality in interval and fuzzy linear programming
- Distributionally robust optimization. A review on theory and applications
- Robust sensitivity analysis for linear programming with ellipsoidal perturbation
- Application of robust optimization for a product portfolio problem using an invasive weed optimization algorithm
- The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions
- Necessary conditions and duality for inexact nonlinear semi-infinite programming problems
- Optimality conditions and duality results for non-differentiable interval optimization problems
- Strong duality for inexact linear programming
- Automatic robust convex programming
- Technical note: Deriving robust and globalized robust solutions of uncertain linear programs with general convex uncertainty sets
- Robustness in Multi-criteria Decision Aiding
- Duality for inexact linear programming problems∗
- Multiobjective Programming Strong Vector Duality
- Matrix Programming with Set-Inclusive Constraints and Objective Set
- Sufficient optimality conditions and duality theory for interval optimization problem
- Cutting plane algorithms for robust conic convex optimization problems
- Connections between generalized, inexact and semi-infinite linear programming
- Duality Theory in Inexact Multiobjective Programming
- Solution and investigation of one class of inexact integer programming problems
- Some generalization of inexact linear programming
- Duality for inexact semi-infinite linear programming
- Positively regular vague matrices
- On second-order conic programming duals for robust convex quadratic optimization problems
- Duality theory in interval-valued linear programming problems
- Optimality conditions and semidefinite linear programming duals for two-stage adjustable robust quadratic optimization
- Approaches to sensitivity analysis in linear programming
- Duality theory for optimization problems with interval-valued objective functions
This page was built for publication: Technical Note—A Duality Theory for Convex Programming with Set-Inclusive Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4775695)
