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) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Mathematical programming (90Cxx) 2-person games (91A05)

Cited in

(29)

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

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)