A Maximization Problem Related to Parametric Linear Complementarity.

Abstract

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 T)(q + 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.

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1975
Accession Number
ADA012999

Entities

People

  • Ikuyo Kaneko

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Computer Programming
  • Concrete
  • Construction Materials
  • Linear Programming
  • Materials
  • Mathematics
  • Reinforced Concrete
  • Safety
  • Safety Factor
  • Simplex Method

Readers

  • Analytical Mechanics
  • Mechanical Engineering/Mechanics of Materials.
  • Operations Research