Redundant objective functions in linear vector maximum problems and their determination

DOI10.1016/0377-2217(77)90025-XMaRDI QIDQ1245072zbMATH OpenOpenAlexFDO

Authors Tomas Gal, Heiner Leberling

Publication date 1977

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(77)90025-x

Mathematics Subject Classification ID

Linear programming (90C05) Polytopes and polyhedra (52Bxx)

Cites work

• scientific article; zbMATH DE number 3350057 (Why is no real title available?)
• scientific article; zbMATH DE number 3194067 (Why is no real title available?)
• A revised simplex method for linear multiple objective programs
• Algorithms for frames and lineality spaces of cones
• Generating all maximal efficient faces for multiple objective linear programs
• Linear multiobjective programming
• Optimale Entscheidung bei mehrfacher Zielsetzung
• Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
• Vektormaximumproblem und parametrische optimierung

Cited in

(22)

• On redundancy in multi criteria decision making
• On efficient sets in vector maximum problems - A brief survey
• On the effects of combining objectives in multi-objective optimization
• An approach to find redundant objective function(s) and redundant constraint(s) in multi-objective nonlinear stochastic fractional programming problems
• Decomposition and coordination for many-objective optimization
• A redundancy detection algorithm for fuzzy stochastic multi-objective linear fractional programming problems
• Approximating the Pareto optimal set using a reduced set of objective functions
• Computational approach to essential and nonessential objective functions in linear multicriteria optimization
• Criteria and dimension reduction of linear multiple criteria optimization problems
• Consequences of dropping nonessential objectives for the application of MCDM methods
• Approximating combinatorial optimization problems with the ordered weighted averaging criterion
• Postoptimal analysis in multicriteria linear programming
• Pareto set analysis: local measures of objective coupling in multiobjective design optimization
• Nonessential objectives within network approaches for MCDM
• A new interactive algorithm for multiobjective linear programming using maximally changeable dominance cone
• Relaxation analysis in linear vectorvalued maximization
• Objective space partitioning using conflict information for solving many-objective problems
• Analysis of multicriteria decision aid in Europe
• Solving multiple objective linear programs in objective space
• IDENTIFICATION OF REDUNDANT OBJECTIVE FUNCTIONS IN MULTI-OBJECTIVE STOCHASTIC FRACTIONAL PROGRAMMING PROBLEMS
• A new algorithm for solving planar multiobjective location problems involving the Manhattan norm
• Weakly and properly nonessential objectives in multiobjective optimization problems

This page was built for publication: Redundant objective functions in linear vector maximum problems and their determination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1245072)