Pages that link to "Item:Q1018182"
From MaRDI portal
The following pages link to Determining maximal efficient faces in multiobjective linear programming problem (Q1018182):
Displaying 8 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)
- Efficient curve fitting: an application of multiobjective programming (Q614418) (← 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)
- A common formula to compute the efficient sets of a class of multiple objective linear programming problems (Q3454856) (← links)
- Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint (Q5139847) (← links)
