Linear max-min programming
From MaRDI portal
Publication:3905079
DOI10.1007/BF01589343zbMath0456.90066MaRDI QIDQ3905079
Publication date: 1981
Published in: Mathematical Programming (Search for Journal in Brave)
algorithmlinear constraintslinear functionalsconvex simplex methodfeasible directionsnon-differentiable programmingmax-min programminggeneral optimality conditionimprovement conemaximizing the minimum valueunique pivoting criteria
Numerical mathematical programming methods (65K05) Convex programming (90C25) Optimality conditions for minimax problems (49K35) Methods of successive quadratic programming type (90C55) Optimality conditions (49K99)
Related Items
Minimax linear programming problem, Linear multiobjective maxmin optimization and some Pareto and lexmaxmin extensions, Linear and combinatorial sharing problems, Relaxation-based algorithms for minimax optimization problems with resource allocation applications, An algorithm for separable nonlinear minimax problems, A lexicographic minimax algorithm for multiperiod resource allocation, Continuous maximin knapsack problems with GLB constraints, A linear-time algorithm for solving continuous maximin knapsack problems, Solving multiple criteria choice problems by interactive trichotomy segmentation, A comparison of two reference point methods in multiple objective mathematical programming., Min-max optimization of several classical discrete optimization problems, Comparative studies in interactive multiple objective mathematical programming, The balanced linear programming problem, The maximax minimax quotient theorem
Cites Work
- Unnamed Item
- A note on a programming problem with maximin objective function
- New Finite Pivoting Rules for the Simplex Method
- Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
- The Convex Simplex Method
- Convex Analysis
- Generation of all integer points for given sets of linear inequalities
