Grouping algorithm for linear goal programming problems

MaRDI QIDQ3626411zbMATH OpenFDO

Authors H. S. Kasana, Krishna Dev Kumar

Publication date 22 May 2009

zbMATH Keywords

sensitivity analysisgoal programmingsimplex methodpriority factors

Mathematics Subject Classification ID

Interior-point methods (90C51) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• scientific article; zbMATH DE number 3873100
• Comparison of Four Goal Programming Algorithms
• A Zero-One Goal-Programming Algorithm Using Partitioning and Constraint Aggregation
• An Algorithm for Solving the Linear Goal Programming Problem by Solving Its Dual
• Comments on "An Algorithm for Solving the Linear Goal-Programming Problem by Solving Its Dual"

Cited in

(2)

• Sequential-Merge Facets for Two-Dimensional Group Problems
• A Zero-One Goal-Programming Algorithm Using Partitioning and Constraint Aggregation

Describes a project that uses

Uses Software

• PariTOP
• PAGP

This page was built for publication: Grouping algorithm for linear goal programming problems

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