Publication:3968756

Publication date: 1979

decomposition; sensitivity analysis; multiobjective programming; branch and bound; duality theory; network optimization; Lagrangian duality; simplex methods; Kuhn-Tucker theorem; complementary pivot algorithm; sequential unconstrained minimization technique; basic results; nondifferentiable concave programming

Mathematics Subject Classification ID

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

90Cxx: Mathematical programming

Related Items

Management of design activities in a concurrent engineering environment, A modified subgradient algorithm for Lagrangean relaxation, Workface planning in synchronous production systems, Spectral projected subgradient with a momentum term for the Lagrangean dual approach, Multi-level production scheduling for a class of flexible machining and assembly systems, On the existence of a minimum integer representation for weighted voting systems, On a space extension algorithm for nondifferentiable optimization, Evolution, games theory and polyhedra, Constructive dual methods for discrete programming, Average shadow price in a mixed integer linear programming problem, Duality for nonlinear multiple-criteria optimization problems, A successive quadratic programming method for a class of constrained nonsmooth optimization problems, Branch-and-bound as a higher-order function, Processors selection and traffic splitting in a parallel processors system, Optimal strategic planning problems in manufacturing based on the input- output models, A technique for speeding up the solution of the Lagrangean dual, Extension of the Frank-Wolfe algorithm to concave nondifferentiable objective functions, Production allocation with dual provisioning, Solving \(0/1\) integer programs with enumeration cutting planes, Note on combinatorial optimization with max-linear objective functions, Optimizing the natural gas supply mix of local distribution utilities, Lagrangean/surrogate relaxation for generalized assignment problems, Lagrangean relaxation. (With comments and rejoinder)., A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables, A new algorithm for the integer knapsack problem and its parallelization, A general parametric analysis approach and its implication to sensitivity analysis in interior point methods, Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes, Exact algorithm for solving a special fixed-charge linear programming problem, A note on node aggregation and Benders' decomposition, A primal simplex variant for the maximum-flow problem, Coordinated scheduling of customer orders for quick response, A non-linear programming approach to kinematic shakedown analysis of composite materials, Preprocessing composite cutting procedure: an approach to the integer model, Un modelo para validar productos en un proceso de compra-venta, The method of double truncation in the decomposition of large-scale problems, A single-server priority queueing-location model, Designing a minimal spanning tree network subject to a budget constraint, A global convergence theorem for aggregation algorithms, Strongly polynomial algorithm for a production-transportation problem with concave production cost, A note on the existence of subgradients, A note on the solution of group knapsack problems, A production and maintenance planning model for the process industry