scientific article; zbMATH DE number 3523317
From MaRDI portal
Publication:4101610
zbMath0334.90032MaRDI QIDQ4101610
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Convex programming (90C25) Integer programming (90C10) Quadratic programming (90C20) Linear programming (90C05) 2-person games (91A05) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (81)
Network design and dynamic routing under queueing demand ⋮ Polyhedral functions and multiparametric linear programming ⋮ A parametric approach to complementarity theory ⋮ Relaxation-based algorithms for minimax optimization problems with resource allocation applications ⋮ A restricted-entry method for a transportation problem with piecewise- linear concave costs ⋮ Stochastic allocation of a resource among partially interchangeable activities ⋮ Stability of the optimal basis of a linear program under uncertainty ⋮ An interactive decision procedure with multiple attributes under risk ⋮ Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods ⋮ Maximizing pseudoconvex transportation problem: A special type ⋮ NP-completeness of the linear complementarity problem ⋮ Extreme point Quadratic Minimization Problem ⋮ Penalty calculations and branching rules in a LAV best subset procedure ⋮ Constructing the minimization diagram of a two-parameter problem ⋮ Best Lipschitz constants of solutions of quadratic programs ⋮ An experimental investigation of enumerative methods for the linear complementarity problem ⋮ Criss-cross methods: A fresh view on pivot algorithms ⋮ Scatter search and star-paths: Beyond the genetic metaphor ⋮ Structure properties of W matrices ⋮ Transportation problem with nonlinear side constraints a branch and bound approach ⋮ Generalized duality and the geometry of linear programming ⋮ On ranking of feasible solutions of a bottleneck linear programming problem ⋮ Stability enhancement and traction control of road vehicles ⋮ Minimizing the number of tardy jobs in two-machine settings with common due date ⋮ A structure-preserving pivotal method for affine variational inequalities ⋮ Convex programming with single separable constraint and bounded variables ⋮ Abstract tropical linear programming ⋮ Algorithms for linear programming with linear complementarity constraints ⋮ Integer linear programming formulation of the material requirements planning problem ⋮ Linear interval inequalities ⋮ An investigation of feasible descent algorithms for estimating the condition number of a matrix ⋮ A heuristic algorithm for a stochastic transportation network ⋮ Optimal algorithms for sensitivity analysis in associative multiplication problems ⋮ Some NP-complete problems in quadratic and nonlinear programming ⋮ A simplex algorithm for network flow problems with piecewise linear fractional objective function ⋮ A Markovian queueing transportation network problem ⋮ Nonlinear one-parametric minimal cost network flow problems ⋮ Cores of partitioning games ⋮ Bottleneck capacitated transportation problem with bounds on rim conditions ⋮ Algorithms for flows with parametric capacities ⋮ On affine scaling algorithms for nonconvex quadratic programming ⋮ A distance assignment approach to the facility layout problem ⋮ Ranking in integer programming with bounded variables. ⋮ A logistics problem: a non-markovian queueing network model and algorithm ⋮ Algorithms for the minimax transportation problem ⋮ Sufficient conditions for the stability of the karush- kuhn - tucker point set in quadratic programming ⋮ An application of homotopy to solving linear programs ⋮ Using bounds on the data in linear programming: The tolerance approach to sensitivity analysis ⋮ An economic model of short-rotation forestry ⋮ Relaxed Dual simplex Approach for Bounded Variable Linear programs ⋮ Computational complexity of LCPs associated with positive definite symmetric matrices ⋮ Primal transportation and transshipment algorithms ⋮ On the expected value of stochastic linear programs and (dynamic) network flow problems ⋮ A range-space implementation for large quadratic programs with small active sets ⋮ A polynomial path-following interior point algorithm for general linear complementarity problems ⋮ Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied ⋮ Generalized isotone optimization with applications to starshaped functions ⋮ Computational complexity of parametric linear programming ⋮ Nonlinear one-parametric linear programming and t-norm transportation problems ⋮ Long-run behavior of constrained discrete-time linear dynamical systems ⋮ A basis-defiency-allowing variation of the simplex method for linear programming ⋮ A class of chance constrained network optimization problems ⋮ More tight monomials in quantized enveloping algebras ⋮ Scheduling of power generation via large-scale nonlinear optimization ⋮ Sensitivity analysis based objective coordination of constrained multi-objective multi-degree-of-freedom optimization ⋮ Sharp bounds for the maximum of the chi-square index in a class of contingency tables with given marginals ⋮ Optimal weights and degeneracy in variable aggregated linear programs ⋮ Piecewise linear programming via interior points ⋮ A Branch and Bound Algorithm for a Transportation Type Problem with Piecewise Linear Convex Objective Function ⋮ A Branch and Bound Algorithm for a Transportation Type Problem with Piecewise Linear Convex Objective Function ⋮ A simple inversion method for determining aerosol size distributions ⋮ Some properties of \(Q\)-matrices ⋮ Minimizing the maximal ratio of weights of a rational Bézier curve ⋮ On trade-off solution pairs in a special type of transportation problem ⋮ A critical index algorithm for nearest point problems on simplicial cones ⋮ A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure ⋮ Pivot rules for linear programming: A survey on recent theoretical developments ⋮ A feasible directions method for computing Bayes E-optimal block designs ⋮ Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games ⋮ Bandwidth allocation in ATM networks ⋮ A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
This page was built for publication:
