Pages that link to "Item:Q1252160"

The following pages link to Generating all maximal efficient faces for multiple objective linear programs (Q1252160):

Displaying 50 items.

• A multiobjective based approach for mathematical programs with linear flexible constraints (Q345535) (← 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)
• A new interactive algorithm for multiobjective linear programming using maximally changeable dominance cone (Q684340) (← links)
• Solving multiple objective linear programs in objective space (Q749446) (← links)
• On the structure of the set bases of a degenerate point (Q795747) (← links)
• A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs (Q872117) (← links)
• A modified method for constructing efficient solutions structure of MOLP (Q967909) (← links)
• Determining maximal efficient faces in multiobjective linear programming problem (Q1018182) (← links)
• A graphical subroutine for multiobjective linear programming (Q1055342) (← links)
• On efficient sets in vector maximum problems - A brief survey (Q1068004) (← links)
• Stability in vector maximization - a survey (Q1074503) (← links)
• Analysis of multicriteria decision aid in Europe (Q1075249) (← links)
• An algorithm for optimizing over the weakly-efficient set (Q1077330) (← links)
• Analysis of the objective space in multiple objective linear programming (Q1095043) (← links)
• Interactive scheme for a MOLP problem given two partial orders: One on variables and one on objectives (Q1095788) (← links)
• Computational experience concerning payoff tables and minimum criterion values over the efficient set (Q1095808) (← links)
• Distributional efficiency in multiobjective stochastic linear programming (Q1127138) (← links)
• A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program (Q1129976) (← links)
• Linear programming with partial information (Q1145068) (← links)
• Bicriteria linear fractional programming (Q1148820) (← links)
• Relaxation analysis in linear vectorvalued maximization (Q1154395) (← links)
• Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples (Q1161923) (← links)
• Equivalent weights for lexicographic multi-objective programs: Characterizations and computations (Q1169409) (← links)
• Bicriteria network flow problems: Continuous case (Q1175771) (← links)
• Efficient solutions for the bicriteria network flow problem (Q1202272) (← links)
• Redundant objective functions in linear vector maximum problems and their determination (Q1245072) (← links)
• A general method for determining the set of all efficient solutions to a linear vectormaximum problem (Q1245073) (← 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)
• Approximating the noninferior set in multiobjective linear programming problems (Q1309915) (← links)
• Finding all maximal efficient faces in multiobjective linear programming (Q1315425) (← links)
• An improved multiple criteria visual interactive method with stepwise focused contouring of efficient criterion vectors (Q1318454) (← links)
• Determination of the efficient set in multiobjective linear programming (Q1321077) (← links)
• Optimization over the efficient set: Four special cases (Q1321439) (← links)
• Optimizing a linear function over an efficient set (Q1342462) (← links)
• Random problem genertion and the computation of efficient extreme points in multiple objective linear programming (Q1342884) (← links)
• Maximal descriptor set characterizations of efficient faces in multiple objective linear programming. (Q1413903) (← links)
• Optimization over the efficient set of a parametric multiple objective linear programming problem (Q1577111) (← 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)
• A graph-based algorithm for the multi-objective optimization of gene regulatory networks (Q1651738) (← links)
• Approximating the noninferior set in linear biobjective programs using multiparametric decomposition (Q1823867) (← links)
• Solving zero-one multiple objective programs through implicit enumeration (Q1835586) (← links)
• A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions (Q1892603) (← links)