Pages that link to "Item:Q1390240"
From MaRDI portal
The following pages link to Minimax regret solution to linear programming problems with an interval objective function (Q1390240):
Displaying 11 items.
- Robust Optimization by Fuzzy Linear Programming (Q4558808) (← links)
- Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization Problems (Q5058052) (← links)
- Convex optimization of interval valued functions on mixed domains (Q5080796) (← links)
- A robust possibilistic programming model for a responsive closed loop supply chain network design (Q5193421) (← links)
- An Extended Necessity Measure Maximisation Incorporating the Trade-Off between Robustness and Satisfaction in Fuzzy LP Problems (Q5877218) (← links)
- A multi-objective robust possibilistic programming approach to sustainable public transportation network design (Q6057606) (← links)
- Robust Algorithms for TSP and Steiner Tree (Q6075747) (← links)
- Robust optimality analysis of non-degenerate basic feasible solutions in linear programming problems with fuzzy objective coefficients (Q6102832) (← links)
- Interval variational inequalities and their relationship with interval optimization problems (Q6118977) (← links)
- Optimization problems with evidential linear objective (Q6178726) (← links)
- Cultural particle swarm optimization algorithms for uncertain multi-objective problems with interval parameters (Q6191212) (← links)