scientific article; zbMATH DE number 3552183

From MaRDI portal
Publication:4126046

zbMath0354.90048MaRDI QIDQ4126046

Saul I. Gass

Publication date: 1975


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (29)

A 2-person game on a polyhedral set of connected strategiesSensivitiy analysis for assessing preferentially independent order relationsMultirational function approximation via linear programmingUnrestricted variables in linear programmingA survey of dynamic network flowsUnnamed ItemThe continuity of two functions associated with a maximin problem with connected variablesFinding the exact lower estimate of the maximin of a minimum function on a polyhedron of connected variablesConstruction of an optimal linear estimate of a parameter from estimates with unknown biases. IIVerification for existence of solutions of linear complementarity problemsNew strings for old Veneziano amplitudes. III: Symplectic treatmentMinimization methods with constraintsOn a particular quadratic network problemStabilisation of discrete-time systems via Schur stability regionComputational complexity of parametric linear programmingOn computer generation of balanced arraysAn algorithm for finding the distribution of maximal entropyDesigns for weighted least squares regression, with estimated weightsGeometry of the Gass-Saaty parametric cost LP algorithmOn the approximation of real rational functions via mixed-integer linear programmingOn a method of retrieving approximate solutions of problems of partially integral linear programmingSolving Linear Programs in Polynomial-TimeSolving Linear Programs in Polynomial-TimeWorst case analysis of resistive networks using linear programming approachOn degeneracy in enumerationThe geometry of linear infeasibilityMethod of solving a system of linear algebraic equations and its applicationAn optimal control problem for the multidimensional diffusion equation with a generalized control variableBibliography in fractional programming




This page was built for publication: