Pages that link to "Item:Q1315425"
From MaRDI portal
The following pages link to Finding all maximal efficient faces in multiobjective linear programming (Q1315425):
Displaying 40 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)
- A parametric simplex algorithm for linear vector optimization problems (Q526835) (← links)
- Constructing efficient solutions structure of multiobjective linear programming (Q557002) (← links)
- Finding a minimal efficient solution of a convex multiobjective program (Q597210) (← links)
- Efficient curve fitting: an application of multiobjective programming (Q614418) (← links)
- Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming (Q642767) (← links)
- Maximizing a linear fractional function on a Pareto efficient frontier (Q700704) (← links)
- Generating the weakly efficient set of nonconvex multiobjective problems (Q934803) (← links)
- The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces (Q946377) (← links)
- Neighbourhood search for constructing Pareto sets (Q1006544) (← links)
- Determining maximal efficient faces in multiobjective linear programming problem (Q1018182) (← links)
- Pareto solutions of polyhedral-valued vector optimization problems in Banach spaces (Q1044248) (← 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)
- A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs (Q1266607) (← links)
- New closedness results for efficient sets in multiple objective mathematical programming (Q1307268) (← links)
- On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program (Q1312767) (← links)
- Determination of the efficient set in multiobjective linear programming (Q1321077) (← links)
- Maximal descriptor set characterizations of efficient faces in multiple objective linear programming. (Q1413903) (← links)
- Outcome space partition of the weight set in multiobjective linear programming (Q1579630) (← links)
- Fully piecewise linear vector optimization problems (Q2046692) (← links)
- Finding non dominated points for multiobjective integer convex programs with linear constraints (Q2162515) (← links)
- Structure of Pareto solutions of generalized polyhedral-valued vector optimization problems in Banach spaces (Q2318898) (← 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)
- An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming (Q2564306) (← links)
- Generating efficient faces for multiobjective linear programming problems (Q2627318) (← links)
- A constraint shifting homotopy method for finding a minimal efficient solution of nonconvex multiobjective programming (Q2943839) (← 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)
- An Algorithm For Solving Multiple Objective Integer Linear Programming Problem (Q4457893) (← links)
- Multiple objective programming with piecewise linear functions (Q4516915) (← links)
- ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS (Q4548050) (← links)
- (Q4714852) (← links)
- Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming (Q4963127) (← links)
- Efficient faces of polytopes: Interior point algorithms, parametrization of algebraic varieties, and multiple objective optimization (Q5202836) (← links)
- Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems (Q5883318) (← links)
- Convergence analysis of a norm minimization-based convex vector optimization algorithm (Q6587338) (← links)
