Linear max-min programming
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3284927 (Why is no real title available?)
- A note on a programming problem with maximin objective function
- Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
- Convex Analysis
- Generation of all integer points for given sets of linear inequalities
- New Finite Pivoting Rules for the Simplex Method
- The Convex Simplex Method
Cited in
(15)- Continuous maximin knapsack problems with GLB constraints
- A linear-time algorithm for solving continuous maximin knapsack problems
- The maximax minimax quotient theorem
- Ranking voting systems and surrogate weights: explicit formulas for centroid weights
- Linear multiobjective maxmin optimization and some Pareto and lexmaxmin extensions
- Comparative studies in interactive multiple objective mathematical programming
- A lexicographic minimax algorithm for multiperiod resource allocation
- Relaxation-based algorithms for minimax optimization problems with resource allocation applications
- Minimax linear programming problem
- Linear and combinatorial sharing problems
- The balanced linear programming problem
- Min-max optimization of several classical discrete optimization problems
- A comparison of two reference point methods in multiple objective mathematical programming.
- An algorithm for separable nonlinear minimax problems
- Solving multiple criteria choice problems by interactive trichotomy segmentation
This page was built for publication: Linear max-min programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3905079)
