Parametric disjunctive programming: One-sided differentiability of the value function
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3901506 (Why is no real title available?)
- scientific article; zbMATH DE number 3926624 (Why is no real title available?)
- A note on duality in disjunctive programming
- A strong duality theorem for the minimum of a family of convex programs
- Duality and Pricing in Multiple Right-Hand Choice Linear Programming Problems
- Duality in disjunctive programming via vector optimization
- One-sided derivatives for the value function in convex parametric programming
- Scalarizing vector optimization problems
Cited in
(8)- Quasiconvex minimization on a locally finite union of convex sets
- Penalty alternating direction methods for mixed-integer optimal control with combinatorial constraints
- On optimality and duality theorems of nonlinear disjunctive fractional minmax programs
- Optimality conditions for disjunctive optimization in reflexive Banach spaces
- Corrigendum: One-Sided Derivatives For The Value Function In Convex Parametric Programming
- One-sided derivatives for the value function in convex parametric programming
- A study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming
- Lipschitz continuity of the value function in mixed-integer optimal control problems
This page was built for publication: Parametric disjunctive programming: One-sided differentiability of the value function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1367803)