Pages that link to "Item:Q4766797"

The following pages link to A revised simplex method for linear multiple objective programs (Q4766797):

Displaying 50 items.

• A cutting plane approach for multi-objective integer indefinite quadratic programming problem (Q260685) (← links)
• Characterizing coherence, correcting incoherence (Q473384) (← links)
• A parametric simplex algorithm for linear vector optimization problems (Q526835) (← links)
• A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem (Q555995) (← links)
• A regression study of the number of efficient extreme points in multiple objective linear programming (Q706929) (← links)
• Potential solutions of linear systems: the multi-criteria multiple constraint levels program (Q754096) (← links)
• A compromise procedure for the multiple objective linear fractional programming problem (Q761358) (← links)
• SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems (Q828878) (← 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)
• Interactive relaxation method for a broad class of integer and continuous nonlinear multiple criteria problems (Q1075943) (← links)
• Weighting factor extensions for finite multiple objective vector minimization problems (Q1106737) (← links)
• A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program (Q1129976) (← links)
• Solving a bicriterion scheduling problem (Q1131944) (← links)
• Application of primitive sets to multi-criteria optimization problems (Q1141590) (← links)
• Duality for nonlinear multiple-criteria optimization problems (Q1145630) (← links)
• Bicriteria linear fractional programming (Q1148820) (← links)
• Multicriteria analysis: Survey and new directions (Q1154393) (← 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)
• On a domination property for vector maximization with respect to cones (Q1161684) (← links)
• Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples (Q1161923) (← links)
• Goal programming with linear fractional criteria (Q1165161) (← links)
• Equivalent weights for lexicographic multi-objective programs: Characterizations and computations (Q1169409) (← links)
• Transformation and restructuring of linear multiobjective programs: A fundamental method to resolve complex problems (Q1178997) (← links)
• A note on solving bicriteria linear programming problems using single criteria software (Q1186007) (← 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)
• Existence of efficient solutions for vector maximization problems (Q1245164) (← links)
• An interactive method as an aid in solving multi-objective mathematical programming problems (Q1249521) (← links)
• The structure of admissible points with respect to cone dominance (Q1250997) (← links)
• Generating all maximal efficient faces for multiple objective linear programs (Q1252160) (← links)
• Inverse programming and the linear vector maximization problem (Q1253615) (← links)
• Connectedness of efficient solutions in multiple criteria combinatorial optimization (Q1278594) (← links)
• New closedness results for efficient sets in multiple objective mathematical programming (Q1307268) (← links)
• A restricted class of multiobjective linear fractional programming problems (Q1309912) (← links)
• Approximating the noninferior set in multiobjective linear programming problems (Q1309915) (← links)
• Finding all maximal efficient faces in multiobjective linear programming (Q1315425) (← 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)
• 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)
• Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming (Q1737503) (← links)
• The vector linear program solver Bensolve -- notes on theoretical background (Q1753500) (← links)