Linear max-min programming

DOI10.1007/BF01589343MaRDI QIDQ3905079zbMATH OpenFDO

Authors Marc E. Posner, Chu-Tao Wu

Publication date 1981

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01589343

zbMATH Keywords

algorithmconvex simplex methodfeasible directionsgeneral optimality conditionimprovement conelinear constraintslinear functionalsmax-min programmingmaximizing the minimum valuenon-differentiable programmingunique pivoting criteria

Mathematics Subject Classification ID

Optimality conditions for minimax problems (49K35) Optimality conditions (49K99) Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Cites work

• 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
• scientific article; zbMATH DE number 3284927 (Why is no real title available?)
• New Finite Pivoting Rules for the Simplex Method
• The Convex Simplex Method

Cited in

(15)

• Minimax linear programming problem
• Linear multiobjective maxmin optimization and some Pareto and lexmaxmin extensions
• Linear and combinatorial sharing problems
• An algorithm for separable nonlinear minimax problems
• A lexicographic minimax algorithm for multiperiod resource allocation
• Min-max optimization of several classical discrete optimization problems
• Comparative studies in interactive multiple objective mathematical programming
• The balanced linear programming problem
• Relaxation-based algorithms for minimax optimization problems with resource allocation applications
• Solving multiple criteria choice problems by interactive trichotomy segmentation
• A comparison of two reference point methods in multiple objective mathematical programming.
• The maximax minimax quotient theorem
• A linear-time algorithm for solving continuous maximin knapsack problems
• Continuous maximin knapsack problems with GLB constraints
• Ranking voting systems and surrogate weights: explicit formulas for centroid weights

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)