The following pages link to Linear max-min programming (Q3905079):
Displayed 13 items.
- Minimax linear programming problem (Q1075944) (← links)
- Linear multiobjective maxmin optimization and some Pareto and lexmaxmin extensions (Q1080368) (← links)
- Linear and combinatorial sharing problems (Q1081535) (← links)
- An algorithm for separable nonlinear minimax problems (Q1093547) (← links)
- A lexicographic minimax algorithm for multiperiod resource allocation (Q1196169) (← links)
- Min-max optimization of several classical discrete optimization problems (Q1265052) (← links)
- Comparative studies in interactive multiple objective mathematical programming (Q1266708) (← links)
- The balanced linear programming problem (Q1278929) (← links)
- Relaxation-based algorithms for minimax optimization problems with resource allocation applications (Q1332312) (← links)
- Solving multiple criteria choice problems by interactive trichotomy segmentation (Q1807938) (← links)
- A comparison of two reference point methods in multiple objective mathematical programming. (Q1811142) (← links)
- A linear-time algorithm for solving continuous maximin knapsack problems (Q2277359) (← links)
- Continuous maximin knapsack problems with GLB constraints (Q3028718) (← links)