Pages that link to "Item:Q1321077"
From MaRDI portal
The following pages link to Determination of the efficient set in multiobjective linear programming (Q1321077):
Displaying 50 items.
- Adjacency based method for generating maximal efficient faces in multiobjective linear programming (Q345543) (← links)
- Saddle points and scalarizing sets in multiple objective linear programming (Q406635) (← links)
- On optimization over the efficient set of a multiple objective linear programming problem (Q511973) (← 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)
- Efficient curve fitting: an application of multiobjective programming (Q614418) (← links)
- Efficiency equivalent polyhedra for the feasible set of multiple objective linear programming (Q700265) (← links)
- A regression study of the number of efficient extreme points in multiple objective linear programming (Q706929) (← links)
- A semidefinite programming approach for solving multiobjective linear programming (Q742135) (← links)
- An integration of efficiency projections into the Geoffrion approach for multiobjective linear programming (Q790048) (← links)
- Constructing the set of efficient objective values in multiple objective linear programs (Q918870) (← links)
- Multi-objective decision analysis for competence-oriented project portfolio selection (Q976375) (← links)
- Neighbourhood search for constructing Pareto sets (Q1006544) (← links)
- Determining maximal efficient faces in multiobjective linear programming problem (Q1018182) (← links)
- A direct approach for finding all efficient solutions for multiobjective programming problems (Q1129917) (← links)
- A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program (Q1129976) (← links)
- Complete efficiency and the initialization of algorithms for multiple objective programming (Q1183391) (← 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)
- Bounds on the number of vertices of perturbed polyhedra (Q1312764) (← links)
- An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex (Q1312773) (← links)
- Finding all maximal efficient faces in multiobjective linear programming (Q1315425) (← links)
- On the efficient point set of tricriteria linear programs (Q1319580) (← links)
- Constructing the set of efficient objective values in linear multiple objective transportation problems (Q1328608) (← links)
- Random problem genertion and the computation of efficient extreme points in multiple objective linear programming (Q1342884) (← links)
- A bookkeeping strategy for multiple objective linear programs (Q1374030) (← 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)
- A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program (Q1600950) (← links)
- Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming (Q1737503) (← links)
- Efficient solution generation for multiple objective linear programming based on extreme ray generation method (Q1887884) (← links)
- A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions (Q1892603) (← links)
- Bi-objective capacitated transportation problem with bounds over distributions and requirement capacities (Q2114885) (← 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)
- 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)
- The Attainment of the Solution of the Dual Program in Vertices for Vectorial Linear Programs (Q3649586) (← links)
- (Q3741454) (← links)
- Note—Finding Certain Weakly-Efficient Vertices in Multiple Objective Linear Fractional Programming (Q3757701) (← links)
- (Q3760310) (← links)
- Linear multicriteria sensitivity and shadow costs (Q4327965) (← links)
- An Algorithm For Solving Multiple Objective Integer Linear Programming Problem (Q4457893) (← links)
- ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS (Q4548050) (← links)
- Efficient faces of polytopes: Interior point algorithms, parametrization of algebraic varieties, and multiple objective optimization (Q5202836) (← links)
- ON EFFICIENT SOLUTION OF MULTIOBJECTIVE LINEAR PROGRAMMING (Q5229471) (← links)
