Parametric disjunctive programming: One-sided differentiability of the value function

DOI10.1023/A:1022603112856zbMath0886.90113OpenAlexW148478106WikidataQ104129328 ScholiaQ104129328MaRDI QIDQ1367803

Martin Gugat

Publication date: 19 April 1998

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022603112856

zbMATH Keywords

sensitivityefficiencymixed integer programmingdisjunctive programmingoptimal value functionfamilies of convex programsparametric family of dual problems

Mathematics Subject Classification ID

Convex programming (90C25) Mixed integer programming (90C11) Multi-objective and goal programming (90C29)

Related Items

On optimality and duality theorems of nonlinear disjunctive fractional minmax programs ⋮ A study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming ⋮ Quasiconvex minimization on a locally finite union of convex sets ⋮ Lipschitz continuity of the value function in mixed-integer optimal control problems ⋮ Optimality conditions for disjunctive optimization in reflexive Banach spaces ⋮ Penalty alternating direction methods for mixed-integer optimal control with combinatorial constraints

Cites Work

• Unnamed Item
• Unnamed Item
• A strong duality theorem for the minimum of a family of convex programs
• A note on duality in disjunctive programming
• Duality in disjunctive programming via vector optimization
• Scalarizing vector optimization problems
• One-sided derivatives for the value function in convex parametric programming
• Duality and Pricing in Multiple Right-Hand Choice Linear Programming Problems