scientific article

John J. Jarvis, Hanif D. Sherali, Mokhtar S. Bazaraa

Publication date: 2 December 2009

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

linear programming sensitivity analysis assignment problems duality transportation problems simplex method interior point methods network flows polynomial-time algorithms decomposition principle out-of-kilter algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic network models in operations research (90B10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Related Items

Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time, A new study on some Vandermonde matrices and systems, An efficient metaheuristic for integrated scheduling and staffing IT projects based on a generalized minimum cost flow network, Minimax regret solution to multiobjective linear programming problems with interval objective functions coefficients, A novel method for solving linear programming problems with symmetric trapezoidal fuzzy numbers, Unnamed Item, Fuzzy linear programming approach for solving transportation problems with interval-valued trapezoidal fuzzy numbers, An approximation scheme for the Kantorovich-Rubinstein problem on compact spaces, Mathematical models and algorithms for a high school timetabling problem, Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming, A novel method for selecting a single efficient unit in data envelopment analysis without explicit inputs/outputs, A novel approach to subgraph selection with multiple weights on arcs, Optimization model applied to radiotherapy planning problem with dose intensity and beam choice, Estimation of hierarchical Archimedean copulas as a shortest path problem, An accelerated Benders decomposition algorithm for solving a double-type double-standard maximal covering location problem, A generalized coupon collecting model as a parsimonious optimal stochastic assignment model, Algebraic and dynamical cancellations associated to spectral sequence, On a fractional minimal cost flow problem on networks, Inverse optimization for multi-objective linear programming, Approximate dynamic programming for lateral transshipment problems in multi-location inventory systems, Immersed NURBS for CFD Applications, Unnamed Item, The use of quasi-concave value functions in MCDM: some theoretical results, The invisible‐hand heuristic for origin‐destination integer multicommodity network flows, An extreme‐point tabu‐search algorithm for fixed‐charge network problems, Selecting slacks-based data envelopment analysis models, Characterizing linearizable QAPs by the level-1 reformulation-linearization technique, New Models for Computing the Distance of DMUs to the Weak Efficient Boundary of Convex and Nonconvex PPSs in DEA, A tree traversal algorithm for decision problems in knot theory and 3-manifold topology, A method for solving linear programming with interval-valued trapezoidal fuzzy variables, Unnamed Item, Solving the moving target search problem using indistinguishable searchers, A novel neural network for solving semidefinite programming problems with some applications, On generating maximal nondominated Benders cuts, Alternative solutions for classifying inputs and outputs in data envelopment analysis, Parametric aggregation in ordered weighted averaging, Solving a tri-criteria best path problem using the fuzzy decision making, Conditions under which adjustability lowers the cost of a robust linear program, Reverse maximum flow problem under the weighted Chebyshev distance, Inverse linear programming with interval coefficients, Unnamed Item, Computing the minimum construction cost of a building's external wall taking into account its energy efficiency, A Complementary Column Generation Approach for the Graph Equipartition Problem, An interval efficiency analysis with dual-role factors, A metaheuristic for a numerical approximation to the mass transfer problem, Selecting most efficient information system projects in presence of user subjective opinions: a DEA approach, Integrated data envelopment analysis: linear vs. nonlinear model, A robust optimization approach for multicast network coding under uncertain link costs, Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem, A new algorithm to solve fully fuzzy linear programming problems using the MOLP problem, Unnamed Item, New data envelopment analysis models for classifying flexible measures: the role of non-Archimedean epsilon, Tight Semi-model-free Bounds on (Bilateral) CVA, Passive Decoy State Quantum Key Distribution, A parameter method for linear algebra and optimization with uncertainties, Control the fibre orientation distribution at the outlet of contraction, Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions, A column generation mathematical programming approach for a class-faculty assignment problem with preferences