Generating all efficient extreme solutions in multiple objective linear programming problem and its application to multiplicative programming

MaRDI QIDQ3582563zbMATH OpenFDO

Authors Nguyen Thi Bach Kim, Nguyen Tuan Thien, Le Quang Thuy

Publication date 2 September 2010

zbMATH Keywords

efficient solutionlinear multiplicative programmingmultiple objective linear programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29)

Recommendations

• Generation of efficient and ε -efficient solutions in multiple objective linear programming
• scientific article; zbMATH DE number 2159095
• Efficient solution generation for multiple objective linear programming based on extreme ray generation method
• An approach for finding efficient points in multiobjective linear programming
• Random problem genertion and the computation of efficient extreme points in multiple objective linear programming

Cited in

(12)

• A direct approach for finding all efficient solutions for multiobjective programming problems
• Random problem genertion and the computation of efficient extreme points in multiple objective linear programming
• A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
• Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming
• Efficient solution generation for multiple objective linear programming based on extreme ray generation method
• An approach for finding efficient points in multiobjective linear programming
• Generation of efficient and ε -efficient solutions in multiple objective linear programming
• A METHOD FOR GENERATING ALL THE EFFICIENT SOLUTIONS OF A 0-1 MULTI-OBJECTIVE LINEAR PROGRAMMING PROBLEM
• scientific article; zbMATH DE number 2159095 (Why is no real title available?)
• scientific article; zbMATH DE number 4114407 (Why is no real title available?)
• Identifying the Efficient Extreme-Points of the Three-Objective Linear Programming Problem
• Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming

This page was built for publication: Generating all efficient extreme solutions in multiple objective linear programming problem and its application to multiplicative programming

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