scientific article
From MaRDI portal
Publication:3844775
zbMath0108.33103MaRDI QIDQ3844775
Publication date: 1963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
A phase-1 approach for the generalized simplex algorithm ⋮ Satisficing solutions and duality in interval and fuzzy linear programming ⋮ Blending simple polytopes at faces ⋮ Game theoretic models for climate change negotiations ⋮ Identification of efficient equilibria in multiproduct trading with indivisibilities and non-monotonicity ⋮ Cascading-heuristics for the solution of staircase linear programs ⋮ A primal-dual homotopy algorithm for \(\ell _{1}\)-minimization with \(\ell _{\infty }\)-constraints ⋮ Parallel search paths for the simplex algorithm ⋮ An analytic symmetrization of max flow-min cut ⋮ A branch and bound network approach to the canonical constrained entropy problem ⋮ Scenario reduction for stochastic programs with conditional value-at-risk ⋮ On linear programming and matrix scaling over the algebraic numbers ⋮ Solution of integer programming problems with inexact data ⋮ A multiple criteria decision model for information system project selection ⋮ Multimodal transport network systems interface, interaction coordination: A specification for control systems integration ⋮ Scatter search and star-paths: Beyond the genetic metaphor ⋮ Combinatorial redundancy detection ⋮ Competitive equilibrium in an exchange economy with indivisibilities ⋮ A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices ⋮ Optimal strategy with one closing instant for a linear optimal guaranteed control problem ⋮ Improvement and its computer implementation of an artificial-free simplex-type algorithm by Arsham ⋮ A binary integer linear program with multi-criteria and multi-constraint levels ⋮ A characterization of an \(n\) by \(2n\) ``\(Q_0\)-matrix ⋮ Resolution of the problem of degeneracy in a primal and dual simplex algorithm ⋮ Non-revisiting paths on surfaces with low genus ⋮ Solving linear optimization over arithmetic constraint formula ⋮ Extended procedure for computing the values of the membership function of a fuzzy solution to a class of fuzzy linear optimization problems ⋮ Water supply operations during drought: A discrete hedging rule ⋮ Graph theoretic relaxations of set covering and set partitioning problems ⋮ Representations and solutions for game-theoretic problems ⋮ Networked bubble propagation: a polynomial-time hypothetical reasoning method for computing near-optimal solutions ⋮ Analysis and synthesis of resistive n-port networks ⋮ Observable restrictions of general equilibrium models with financial markets. ⋮ Motion tracking as a constrained optimization problem. ⋮ The pairwise egalitarian solution. ⋮ Customizing the solution process of COIN-OR's linear solvers with python ⋮ Characterizing the Delaunay decompositions of compact hyperbolic surfaces ⋮ Analyzing the potential of a firm: an operations research approach. ⋮ The hierarchy of circuit diameters and transportation polytopes ⋮ Colorful linear programming, Nash equilibrium, and pivots ⋮ Single machine batch scheduling with jointly compressible setup and processing times. ⋮ An LP-based algorithm for the data association problem in multitarget tracking. ⋮ Experimental complexity analysis of continuous constraint satisfaction problems. ⋮ Some lower bounds for \(H(n)\) in Hilbert's 16th problem ⋮ Linear fractional approximations for master problems in column generation ⋮ A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints ⋮ Robust multiobjective optimization with application to Internet routing ⋮ Critical objective function values in linear sum assignment problems ⋮ An efficient model and algorithm for the transmission-constrained multi-site combined heat and power system ⋮ A network simplex method for the budget-constrained minimum cost flow problem ⋮ Heuristics for multi-item two-echelon spare parts inventory control subject to aggregate and individual service measures ⋮ A population-based fast algorithm for a billion-dimensional resource allocation problem with integer variables ⋮ A global tolerance approach to sensitivity analysis in linear programming ⋮ Integer programming for urban design ⋮ Two-sided allocation problems, decomposability, and the impossibility of efficient trade ⋮ Cycling in linear programming problems ⋮ Group scheduling with controllable setup and processing times: minimizing total weighted completion time ⋮ The diameters of network-flow polytopes satisfy the Hirsch conjecture ⋮ Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied ⋮ Centered solutions for uncertain linear equations ⋮ Searching for realizations of finite metric spaces in tight spans ⋮ A transportation model with multiple criteria and multiple constraint levels ⋮ A basis-defiency-allowing variation of the simplex method for linear programming ⋮ Perturbation analysis of general LP models: A unified approach to sensitivity, parametric, tolerance, and more-for-less analysis ⋮ Guaranteeing parameter estimation with anomalous measurement errors ⋮ Fast finite methods for a system of linear inequalities ⋮ An algorithm for the shakedown analysis of plane frames ⋮ Future paths for integer programming and links to artificial intelligence ⋮ Stability of the constant cost dynamic lot size model ⋮ An inventory model with component commonality ⋮ On possibilistic linear programming ⋮ Maintaining LU factors of a general sparse matrix ⋮ Posynomial geometric programming as a special case of semi-infinite linear programming ⋮ A natural notion of morphism for linear programming problems ⋮ Representability of functions ⋮ \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation. ⋮ Heuristic and exact algorithms for the simultaneous assignment problem ⋮ Optimization over the efficient set of a parametric multiple objective linear programming problem ⋮ Decentralized and hierarchical control under consistency or disagreement of interests ⋮ A pathological case in the reduction of linear programs ⋮ Some NP-complete problems in linear programming ⋮ Solution of nonlinear programming with unknown distribution function ⋮ Forest monitoring and harvesting policies ⋮ A mixed dynamics approach for linear corridor policies: A revisitation of dynamic setup scheduling and flow control in manufacturing systems ⋮ Estimating the weights for multiple attributes in a composite criterion using pairwise judgments ⋮ Linear programs dependent on a single parameter ⋮ Isotone optimization. I ⋮ Some methods for the numerical solution of variational inequalities with two obstacles ⋮ A tutorial history of least squares with applications to astronomy and geodesy ⋮ Fair transfer price and inventory holding policies in two-enterprise supply chains ⋮ Symbiosis between linear algebra and optimization ⋮ Approximating separable nonlinear functions via mixed zero-one programs ⋮ Piecewise linear methods for nonlinear equations and optimization ⋮ Pivot versus interior point methods: Pros and cons ⋮ Advances in design and implementation of optimization software ⋮ Operational planning of district heating and cooling plants through genetic algorithms for mixed 0-1 linear programming ⋮ An asymptotic simplex method for singularly perturbed linear programs ⋮ On an approach to the modelling of problems connected with conflicting economic interests ⋮ Measuring inconsistency ⋮ Entropic perturbation method for solving a system of linear inequalities
This page was built for publication: