scientific article; zbMATH DE number 3552183

MaRDI QIDQ4126046zbMATH OpenFDO

Authors Saul I. Gass

Publication date 1975

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) 2-person games (91A05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Mathematical programming (90Cxx)

Cited in

(29)

• Method of solving a system of linear algebraic equations and its application
• Designs for weighted least squares regression, with estimated weights
• An optimal control problem for the multidimensional diffusion equation with a generalized control variable
• On computer generation of balanced arrays
• Unrestricted variables in linear programming
• Computational complexity of parametric linear programming
• On a particular quadratic network problem
• The continuity of two functions associated with a maximin problem with connected variables
• Stabilisation of discrete-time systems via Schur stability region
• Construction of an optimal linear estimate of a parameter from estimates with unknown biases. II
• The geometry of linear infeasibility
• Minimization methods with constraints
• Bibliography in fractional programming
• Solving Linear Programs in Polynomial-Time
• On a method of retrieving approximate solutions of problems of partially integral linear programming
• A 2-person game on a polyhedral set of connected strategies
• Verification for existence of solutions of linear complementarity problems
• A survey of dynamic network flows
• On degeneracy in enumeration
• Worst case analysis of resistive networks using linear programming approach
• An algorithm for finding the distribution of maximal entropy
• Sensivitiy analysis for assessing preferentially independent order relations
• Convex hulls of Grassmannians and combinatorics of symmetric hypermatrices
• On the approximation of real rational functions via mixed-integer linear programming
• New strings for old Veneziano amplitudes. III: Symplectic treatment
• Finding the exact lower estimate of the maximin of a minimum function on a polyhedron of connected variables
• Multirational function approximation via linear programming
• Solving Linear Programs in Polynomial-Time
• Geometry of the Gass-Saaty parametric cost LP algorithm

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4126046)