Pages that link to "Item:Q2564306"

The following pages link to An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming (Q2564306):

Displaying 21 items.

• Biobjective robust optimization over the efficient set for Pareto set reduction (Q322934) (← links)
• Adjacency based method for generating maximal efficient faces in multiobjective linear programming (Q345543) (← links)
• A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions (Q513166) (← links)
• Constructing efficient solutions structure of multiobjective linear programming (Q557002) (← links)
• Finding DEA-efficient hyperplanes using MOLP efficient faces (Q609208) (← links)
• Generating random points (or vectors) controlling the percentage of them that are extreme in their convex (or positive) hull (Q814963) (← links)
• Determining maximal efficient faces in multiobjective linear programming problem (Q1018182) (← links)
• Further analysis of an outcome set-based algorithm for multiple-objective linear programming (Q1264984) (← links)
• Hybrid approach for solving multiple-objective linear programs in outcome space (Q1265035) (← links)
• Maximal descriptor set characterizations of efficient faces in multiple objective linear programming. (Q1413903) (← links)
• A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program (Q1600950) (← links)
• Bilevel programming for generating discrete representations in multiobjective optimization (Q1646577) (← links)
• A multiple objective programming approach to linear bilevel multi-follower programming (Q2127786) (← links)
• GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs (Q2327904) (← links)
• The maximal descriptor index set for a face of a convex polyhedral set and some applications (Q2345491) (← links)
• Minimal representations of a face of a convex polyhedron and some applications (Q2667218) (← links)
• A NEW APPROACH TO SELECT THE BEST SUBSET OF PREDICTORS IN LINEAR REGRESSION MODELLING: BI-OBJECTIVE MIXED INTEGER LINEAR PROGRAMMING (Q3122035) (← links)
• A common formula to compute the efficient sets of a class of multiple objective linear programming problems (Q3454856) (← links)
• An approach for finding efficient points in multiobjective linear programming (Q3602248) (← links)
• (Q4963438) (← links)
• Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint (Q5139847) (← links)