scientific article; zbMATH DE number 883252
From MaRDI portal
Publication:4879697
Recommendations
- Duality for nondifferentiable nonlinear programming problems: A feasible direction approach
- scientific article; zbMATH DE number 14317
- scientific article; zbMATH DE number 1792004
- scientific article; zbMATH DE number 3963587
- A new dual problem for nondifferentiable convex programming
- scientific article; zbMATH DE number 7295259
- New double projection algorithms for non-monotone variational inequality problems
- Proper Efficiency and Multiobjective Duality in Nonlinear Programming
- Generalized dual to the monotone nonlinear complementarity problem
- Duality for programs involving non-separable objective functions
Cited in
(6)- A projective simplex algorithm using LU decomposition
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
- A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule
- A basis-defiency-allowing variation of the simplex method for linear programming
- Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis
- A dual projective simplex method for linear programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4879697)
