Publication:3649086

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

Publication date: 2 December 2009

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

90C05: Linear programming

90B10: Deterministic network models in operations research

90-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming

Related Items

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