Answers are grounded in this paper and cite their sources.
Redundancy in constraints and variables are usually studied in linear, integer and non-linear programming problems. However, main emphasis has so far been given only to linear programming problems. In this paper, an algorithm that identifies redundant objective functions in multi-objective stochastic fractional programming problems is provided. A solution procedure is also illustrated. This reduces the number of objective functions in cases where redundant objective functions exist.
No takes yet. Share an insight, caveat, or question.
Charles et al. (2006) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: