Optimality and duality without a constraint qualification for minimax programming
From MaRDI portal
Recommendations
- Duality without a constraint qualification for minimax fractional programming
- Duality without constraint qualification in nonsmooth optimization
- scientific article; zbMATH DE number 3847230
- scientific article; zbMATH DE number 279301
- scientific article; zbMATH DE number 1552795
- scientific article; zbMATH DE number 3918106
- scientific article; zbMATH DE number 3934789
- Optimality, minimax and duality in nonlinear programming
- scientific article; zbMATH DE number 810056
- scientific article; zbMATH DE number 4085436
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3711742 (Why is no real title available?)
- Duality in generalized linear fractional programming
- Duality without a constraint qualification for minimax fractional programming
- Duality without constraint qualification for multiobjective programming
- On mixed duality in mathematical programming.
This page was built for publication: Optimality and duality without a constraint qualification for minimax programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4807991)