Pages that link to "Item:Q1018182"

The following pages link to Determining maximal efficient faces in multiobjective linear programming problem (Q1018182):

Displaying 16 items.

• A multiobjective based approach for mathematical programs with linear flexible constraints (Q345535) (← links)
• Adjacency based method for generating maximal efficient faces in multiobjective linear programming (Q345543) (← links)
• A new method for determining all maximal efficient faces in multiple objective linear programming (Q514052) (← links)
• Constructing efficient solutions structure of multiobjective linear programming (Q557002) (← links)
• Efficient curve fitting: an application of multiobjective programming (Q614418) (← links)
• A modified method for constructing efficient solutions structure of MOLP (Q967909) (← links)
• A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs (Q1266607) (← links)
• Finding all maximal efficient faces in multiobjective linear programming (Q1315425) (← links)
• Maximal descriptor set characterizations of efficient faces in multiple objective linear programming. (Q1413903) (← links)
• Finding non dominated points for multiobjective integer convex programs with linear constraints (Q2162515) (← links)
• The maximal descriptor index set for a face of a convex polyhedral set and some applications (Q2345491) (← links)
• Generating efficient faces for multiobjective linear programming problems (Q2627318) (← links)
• A common formula to compute the efficient sets of a class of multiple objective linear programming problems (Q3454856) (← links)
• (Q4714852) (← links)
• Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming (Q4963127) (← links)
• Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint (Q5139847) (← links)