scientific article

No author found.

Publication date: 5 June 1993

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

goal programming multiple criteria decision making nondifferentiable optimization Optimization subgradient polyhedral combinatorics ellipsoid method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Management decision making, including multiple objectives (90B50) Deterministic network models in operations research (90B10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Mathematical programming (90Cxx) Conference proceedings and collections of articles (00Bxx) Polytopes and polyhedra (52Bxx)

Related Items

A phase-1 approach for the generalized simplex algorithm, Algorithms for finding a \(K\)th best valued assignment, Computing maximum mean cuts, Enumeration of support-closed subsets in confluent systems, A network flow algorithm for just-in-time project scheduling, The approximation of separable stochastic programs, A stochastic approach to stability in stochastic programming, On some difficult linear programs coming from set partitioning, Form Assessment in Coordinate Metrology, A tilted cutting plane proximal bundle method for convex nondifferentiable optimization, Minmax regret location--allocation problem on a network under uncertainty, A branch-and-price algorithm for the capacitated facility location problem, Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming, Incremental assignment problem, Possible and necessary optimality tests in possibilistic linear programming problems, Genetic algorithms and call admission to telecommunications networks, The existence of optimal parameters of the generalized logistic function, Optimal plan for multiple debris removal missions, Distributional efficiency in multiobjective stochastic linear programming, A dual projective simplex method for linear programming, Stochastic annealing for synthesis under uncertainty, Multiple space debris collecting mission: optimal mission planning, Minimax regret solution to linear programming problems with an interval objective function, Polynomial solvability of cost-based abduction, Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds, Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods, An effective approach for optimization of a perishable inventory system with uncertainty in both demand and supply, From approximate to exact integer programming, A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs, A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods, On robust Karush-Kuhn-Tucker multipliers rules for semi-infinite multiobjective optimization with data uncertainty, Constraint qualifications and optimality conditions for robust nonsmooth semi-infinite multiobjective optimization problems, Hybrid heuristic algorithms for set covering., An expected regret minimization portfolio selection model, A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem, Large-scale convex optimization methods for air quality policy assessment., Automated generation of Kempe linkage and its complexity, On finding a vertex solution using interior point methods, Possibilistic linear programming: A brief review of fuzzy mathematical programming and a comparison with stochastic programming in portfolio selection problem, Minimizing a stochastic convex function subject to stochastic constraints and some applications, Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach, A new filled function method applied to unconstrained global optimization, A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming, Polynomial time recognition of essential graphs having stability number equal to matching number, The use of domains in multicriteria decision making, A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs, The skeleton of acyclic Birkhoff polytopes, A spline smoothing Newton method for finite minimax problems, Two strongly polynomial cut cancelling algorithms for minimum cost network flow, Portfolio adjusting optimization under credibility measures, Controlling the losing probability in a monotone game, Outbound supply chain network design with mode selection and lead time considerations, Numerical analyses of discontinuous material bifurcation: strong and weak discontinuities, Bundle-based relaxation methods for multicommodity capacitated fixed charge network design, Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers, Near-optimal solutions to large-scale facility location problems, On the modeling of highly localized deformations induced by material failure: the strong discontinuity approach, Generalized derivatives of the optimal value of a linear program with respect to matrix coefficients, A basis-defiency-allowing variation of the simplex method for linear programming, Tighter relaxations for the cutting stock problem, Probabilistic temporal networks: A unified framework for reasoning with time and uncertainty, Two-Stage Stochastic Programming with Linearly Bi-parameterized Quadratic Recourse, Implied constraints and an alternate unified development of nonlinear programming theory, Existence results for special nonlinear total least squares problem, A parameter-tuned genetic algorithm for the resource investment problem with discounted cash flows and generalized precedence relations, Scheduling divisible loads with time and cost constraints, Optimization of a nonlinear dynamical system for global climate change, Stochastic linear programs with restricted recourse, The asymmetric traveling salesman problem with replenishment arcs, Discrete convex analysis, Projections of the capacitated network loading problem, A decisional procedure for water resources planning taking into account water quality constraints, Gomory cuts revisited, Extension of M-convexity and L-convexity to polyhedral convex functions, Computational assessment of distributed decomposition methods for stochastic linear programs, Stabilized column generation, Robust shortest path planning and semicontractive dynamic programming, A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem, A polyhedral approach to sequence alignment problems, Efficient hybrid methods for global continuous optimization based on simulated annealing, A multi-period machine assignment problem, A stochastic programming model for scheduling maintenance personnel, Variable metric methods for unconstrained optimization and nonlinear least squares, A Singularity of Fertility Decline Is Lot-et-Garonne, A linear constraint satisfaction approach to cost-based abduction, On the maximum capacity augmentation algorithm for the maximum flow problem, Computing the degree of a vertex in the skeleton of acyclic Birkhoff polytopes, Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters, An automated system for simulation and parameter identification of inelastic constitutive models, A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem, Mean utility in the assurance region model, Directed Steiner problems with connectivity constraints, The maximum flow problem: A max-preflow approach, A tabu search heuristic and adaptive memory procedure for political districting, Optimized Bonferroni approximations of distributionally robust joint chance constraints