Technical Note—A Duality Theory for Convex Programming with Set-Inclusive Constraints
From MaRDI portal
Publication:4775695
DOI10.1287/opre.22.4.892zbMath0287.90015OpenAlexW2170645540MaRDI QIDQ4775695
No author found.
Publication date: 1974
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.22.4.892
Related Items (35)
Satisficing solutions and duality in interval and fuzzy linear programming ⋮ Automatic robust convex programming ⋮ Objective function bounds for the inexact linear programming problem with generalized cost coefficients ⋮ On some optimization problems under uncertainty ⋮ The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions ⋮ Optimality conditions and duality results for non-differentiable interval optimization problems ⋮ Sufficient optimality conditions and duality theory for interval optimization problem ⋮ Connections between generalized, inexact and semi-infinite linear programming ⋮ Solution and investigation of one class of inexact integer programming problems ⋮ Technical Note—Deriving Robust and Globalized Robust Solutions of Uncertain Linear Programs with General Convex Uncertainty Sets ⋮ Multiobjective Programming Strong Vector Duality ⋮ Robust sensitivity analysis for linear programming with ellipsoidal perturbation ⋮ On second-order conic programming duals for robust convex quadratic optimization problems ⋮ Some generalization of inexact linear programming ⋮ Convex programming with set-inclusive contraints and its applications to generalized linear and fractional programming ⋮ Duality theory in interval-valued linear programming problems ⋮ Duality Theory in Inexact Multiobjective Programming ⋮ Strong duality for inexact linear programming ⋮ Necessary conditions and duality for inexact nonlinear semi-infinite programming problems ⋮ Duality theory for optimization problems with interval-valued objective functions ⋮ Positively regular vague matrices ⋮ Application of robust optimization for a product portfolio problem using an invasive weed optimization algorithm ⋮ Robustness in Multi-criteria Decision Aiding ⋮ Matrix Programming with Set-Inclusive Constraints and Objective Set ⋮ Intuitionistic fuzzy linear programming and duality: a level sets approach ⋮ Inexact linear programming with generalized resource sets ⋮ Duality for inexact semi-infinite linear programming ⋮ Wolfe duality for interval-valued optimization ⋮ Relaxed robust second-order-cone programming ⋮ Approaches to sensitivity analysis in linear programming ⋮ Distributionally robust optimization. A review on theory and applications ⋮ Continuous time programming with set-inclusive constraints and objective set ⋮ Cutting plane algorithms for robust conic convex optimization problems ⋮ Duality for inexact linear programming problems∗ ⋮ Duality in inexact fractional programming with set-inclusive constraints
This page was built for publication: Technical Note—A Duality Theory for Convex Programming with Set-Inclusive Constraints
