Vertex-searching method for linear interaction programming

DOI10.1007/S11859-010-0205-XMaRDI QIDQ3017381zbMATH OpenOpenAlexFDO

Authors Qingfei Pan, Ying Xiong, Hui Qi

Publication date 19 July 2011

Published in Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11859-010-0205-x

zbMATH Keywords

equilibrium solutionlinear interaction programmingrestriction regionvertex-searching method

Mathematics Subject Classification ID

Search theory (90B40) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• scientific article; zbMATH DE number 1839534
• On finding a vertex solution using interior point methods
• The linearization method: Principal concepts and perspective directions
• The linearization method
• scientific article; zbMATH DE number 4189470

Cites work

• Decomposition method using augmented Lagrangian for solving systems of variational inequalities
• Equilibrium points in n -person games
• Equilibrium programming:The path following approach and dynamics
• scientific article; zbMATH DE number 1506035 (Why is no real title available?)

Cited in

(2)

• Determination of optimal vertices from feasible solutions in unimodular linear programming
• scientific article; zbMATH DE number 1839534 (Why is no real title available?)

This page was built for publication: Vertex-searching method for linear interaction programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3017381)