scientific article; zbMATH DE number 883252

zbMATH Open0844.90055MaRDI QIDQ4879697FDOQ4879697

Ping-Qi Pan

Publication date: 2 June 1996

Title of this publication is not available (Why is that?)

Recommendations

• Duality for nondifferentiable nonlinear programming problems: A feasible direction approach
• [[:Publication:3976890|Title not available (Why is that?)]]
• [[:Publication:4551946|Title not available (Why is that?)]]
• [[:Publication:3731382|Title not available (Why is that?)]]
• A new dual problem for nondifferentiable convex programming
• [[:Publication:3385735|Title not available (Why is that?)]]
• [[:Publication:3386245|Title not available (Why is that?)]]
• Proper Efficiency and Multiobjective Duality in Nonlinear Programming
• Generalized dual to the monotone nonlinear complementarity problem
• Duality for programs involving non-separable objective functions

zbMATH Keywords

dual simplex algorithmdual feasibilitynon-monotone procedures

Mathematics Subject Classification ID

Linear programming (90C05)

Cited In (6)

• A projective simplex algorithm using LU decomposition
• A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule
• The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
• A dual projective simplex method for linear programming
• 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

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)