A Maximization Problem Related to Parametric Linear Complementarity.
STANFORD UNIV CALIF SYSTEMS OPTIMIZATION LAB
Pagination or Media Count:
Conditions are given under which one can solve the following maximization problem by the simplex method for linear programming maximize alpha subject to q alpha p Mz or 0 a or z or 0 alpha or 0 z sup Tq alpha p Mz 0, where q or 0, a 0 and M is a P-matrix. This problem emerges in the theory of inelastic analysis of reinforced concrete frames when one wants to determine the safety factor of a structure against local failure.
- Operations Research