A revised simplex method for linear multiple objective programs
From MaRDI portal
Publication:4766797
DOI10.1007/BF01580111zbMath0281.90045OpenAlexW1973065348WikidataQ56454541 ScholiaQ56454541MaRDI QIDQ4766797
No author found.
Publication date: 1973
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580111
Related Items
Interactive relaxation method for a broad class of integer and continuous nonlinear multiple criteria problems, SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems, Bilevel linear programming, Multiobjective flow control in delay constrained telecommunication networks, Optimizing a linear function over an efficient set, Random problem genertion and the computation of efficient extreme points in multiple objective linear programming, Goal Programming Methods and Applications: A Survey, Engineering design: applications of goal programming and multiple objective linear and geometric programming‡, Weighting factor extensions for finite multiple objective vector minimization problems, A norm minimization-based convex vector optimization algorithm, A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program, Solving a bicriterion scheduling problem, Application of vector optimization processes in large-scale models, A new exact method for linear bilevel problems with multiple objective functions at the lower level, Application of primitive sets to multi-criteria optimization problems, Multiobjective integer nonlinear fractional programming problem: a cutting plane approach, Duality for nonlinear multiple-criteria optimization problems, Use of the Reduced Tolerance Approach to Rank Efficient Solutions, Bicriteria linear fractional programming, Multicriteria analysis: Survey and new directions, Relaxation analysis in linear vectorvalued maximization, Linear programming with multiple fuzzy goals, Maximal descriptor set characterizations of efficient faces in multiple objective linear programming., Admissible points of a convex polyhedron, An algorithm for the multiple objective integer linear programming problem, On a domination property for vector maximization with respect to cones, Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples, Goal programming with linear fractional criteria, Equivalent weights for lexicographic multi-objective programs: Characterizations and computations, Characterizing coherence, correcting incoherence, Application of fuzzy multiple goal programming on the selection for power plants considering site and environmental constraints, Transformation and restructuring of linear multiobjective programs: A fundamental method to resolve complex problems, Generation of efficient and ε -efficient solutions in multiple objective linear programming, Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming, Optimization over the efficient set, A note on solving bicriteria linear programming problems using single criteria software, The vector linear program solver Bensolve -- notes on theoretical background, A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems, Efficient solutions for the bicriteria network flow problem, A parametric simplex algorithm for linear vector optimization problems, Tractability of convex vector optimization problems in the sense of polyhedral approximations, Solution procedures for multi-objective markov decision processes, Efficiency in multiple objective optimization problems, A regression study of the number of efficient extreme points in multiple objective linear programming, A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem, Theory and algorithms for linear multiple objective programs with zero–one variables, Vector maximization at a degenerate vertex, On some relations between a dual pair of multiple objective linear programs, Linear multiple objective programs with zero–one variables, Biobjective optimization over the efficient set of multiobjective integer programming problem, Redundant objective functions in linear vector maximum problems and their determination, A general method for determining the set of all efficient solutions to a linear vectormaximum problem, Existence of efficient solutions for vector maximization problems, Finding all efficient extreme points for multiple objective linear programs, A modified TOPSIS method based on \(D\) numbers and its applications in human resources selection, An interactive method as an aid in solving multi-objective mathematical programming problems, The structure of admissible points with respect to cone dominance, A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method, Generating all maximal efficient faces for multiple objective linear programs, Inverse programming and the linear vector maximization problem, Potential solutions of linear systems: the multi-criteria multiple constraint levels program, A compromise procedure for the multiple objective linear fractional programming problem, Connectedness of efficient solutions in multiple criteria combinatorial optimization, Approximating the noninferior set in linear biobjective programs using multiparametric decomposition, The Attainment of the Solution of the Dual Program in Vertices for Vectorial Linear Programs, Solving zero-one multiple objective programs through implicit enumeration, Optimization over the efficient set of a parametric multiple objective linear programming problem, An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming, GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs, Concepts of proper efficiency, Growth and utility maximization., New closedness results for efficient sets in multiple objective mathematical programming, A restricted class of multiobjective linear fractional programming problems, Approximating the noninferior set in multiobjective linear programming problems, The maximal descriptor index set for a face of a convex polyhedral set and some applications, Finding all maximal efficient faces in multiobjective linear programming, On efficient sets in vector maximum problems - A brief survey, Determination of the efficient set in multiobjective linear programming, The compromise hypersphere for multiobjective linear programming, Stability in vector maximization - a survey, A cutting plane approach for multi-objective integer indefinite quadratic programming problem, Analysis of multicriteria decision aid in Europe
Cites Work
