Pages that link to "Item:Q4166598"

The following pages link to Finding all efficient extreme points for multiple objective linear programs (Q4166598):

Displaying 50 items.

• A cutting plane approach for multi-objective integer indefinite quadratic programming problem (Q260685) (← links)
• A new algorithm for linear multiobjective programming problems with bounded variables (Q471311) (← links)
• On Benson's scalarization in multiobjective optimization (Q518145) (← links)
• A parametric simplex algorithm for linear vector optimization problems (Q526835) (← links)
• Set contraction algorithm for computing Pareto set in nonconvex nonsmooth multiobjective optimization (Q557143) (← links)
• Goal-optimal Pareto solution of multiobjective linear programs and its computing with standard single objective LP software (Q597396) (← 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)
• Linear complementarity problems and multiple objective programming (Q689137) (← links)
• Minimization of a quasi-concave function over an efficient set (Q689154) (← links)
• A regression study of the number of efficient extreme points in multiple objective linear programming (Q706929) (← links)
• Solving multiple objective linear programs in objective space (Q749446) (← links)
• Potential solutions of linear systems: the multi-criteria multiple constraint levels program (Q754096) (← links)
• Fuzzy approaches for multiple objective linear fractional optimization (Q798570) (← links)
• Solving bilevel linear programs using multiple objective linear programming (Q1016404) (← links)
• Determining maximal efficient faces in multiobjective linear programming problem (Q1018182) (← links)
• Efficiency and proper efficiency in vector maximization with respect to cones (Q1055343) (← links)
• On efficient sets in vector maximum problems - A brief survey (Q1068004) (← 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)
• 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)
• A multicriteria approach to the location of public facilities (Q1138985) (← links)
• Application of primitive sets to multi-criteria optimization problems (Q1141590) (← links)
• Relaxation analysis in linear vectorvalued maximization (Q1154395) (← links)
• Linear programming with multiple fuzzy goals (Q1154942) (← links)
• Admissible points of a convex polyhedron (Q1157772) (← links)
• An algorithm for the multiple objective integer linear programming problem (Q1160567) (← links)
• An algorithm for bicriterion linear programming (Q1163481) (← links)
• Equivalent weights for lexicographic multi-objective programs: Characterizations and computations (Q1169409) (← links)
• Bicriteria network flow problems: Continuous case (Q1175771) (← links)
• Transformation and restructuring of linear multiobjective programs: A fundamental method to resolve complex problems (Q1178997) (← links)
• Applications of the parametric programming procedure (Q1179007) (← links)
• A simplified MOLP algorithm: The MOLP-S procedure (Q1184461) (← links)
• Multiple-objective programming with polynomial objectives and constraints (Q1197675) (← links)
• Efficient solutions for the bicriteria network flow problem (Q1202272) (← links)
• A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case (Q1207046) (← links)
• A general method for determining the set of all efficient solutions to a linear vectormaximum problem (Q1245073) (← links)
• Generating all maximal efficient faces for multiple objective linear programs (Q1252160) (← 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)
• Finding all maximal efficient faces in multiobjective linear programming (Q1315425) (← links)
• Enumerating extreme points of a highly degenerate polytope (Q1318458) (← links)
• Determination of the efficient set in multiobjective linear programming (Q1321077) (← links)
• Multiobjective flow control in delay constrained telecommunication networks (Q1338682) (← links)
• Optimizing a linear function over an efficient set (Q1342462) (← links)
• A bookkeeping strategy for multiple objective linear programs (Q1374030) (← links)
• Finding a weights-restricted efficient (extreme) point and using it for solving MOLP problems. (Q1428193) (← links)
• Optimization over the efficient set of a parametric multiple objective linear programming problem (Q1577111) (← links)