Linear max-min programming (Q3905079): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: New Finite Pivoting Rules for the Simplex Method / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Generation of all integer points for given sets of linear inequalities / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Convex Analysis / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5564917 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on a programming problem with maximin objective function / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Convex Simplex Method / rank | |||
Normal rank | |||
Latest revision as of 10:53, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear max-min programming |
scientific article |
Statements
Linear max-min programming (English)
0 references
1981
0 references
non-differentiable programming
0 references
max-min programming
0 references
maximizing the minimum value
0 references
linear functionals
0 references
linear constraints
0 references
general optimality condition
0 references
algorithm
0 references
feasible directions
0 references
improvement cone
0 references
unique pivoting criteria
0 references
convex simplex method
0 references
0 references
