scientific article; zbMATH DE number 943301

zbMATH Open0858.90096MaRDI QIDQ4714852FDOQ4714852

Guozhen Ruan

Publication date: 7 November 1996

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

Recommendations

• scientific article; zbMATH DE number 980246
• On an efficient implementation of the face algorithm for linear programming
• Generating efficient faces for multiobjective linear programming problems
• Determining maximal efficient faces in multiobjective linear programming problem
• Finding all maximal efficient faces in multiobjective linear programming
• A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming
• A new method for determining all maximal efficient faces in multiple objective linear programming
• Lagrangean duality for facial programs with applications to integer and complementarity problems
• Adjacency based method for generating maximal efficient faces in multiobjective linear programming
• Optimization of linear-convex programs

zbMATH Keywords

simplex algorithmco-optimal face

Mathematics Subject Classification ID

Linear programming (90C05)

Cited In (3)

• A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming
• Generating efficient faces for multiobjective linear programming problems
• Title not available (Why is that?)

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 Q4714852)