Publication:3844775

Related Items

Generalized optimal designs and contingency plans in linear systems, A new neural network for solving linear programming problems, The supplier-firm-buyer game and its $m$-sided generalization, Scheduling projects to maximize net present value -- the case of time-dependent, contingent cash flows, The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study, Modelling and analysis of multistage stochastic programming problems: A software environment, Using an interior point method for the master problem in a decomposition approach, Condition measures and properties of the central trajectory of a linear program, Designing paced assembly lines with fixed number of stations, Optimal system design with MC$^2$ linear programming: A dual contingency plan approach, More polytopes meeting the conjectured Hirsch bound, Interior-point methods with decomposition for solving large-scale linear programs, A lexicographic algebraic theorem and its applications, Cost allocation in the Chinese postman problem, A linear and discrete programming framework for representing qualitative knowledge, Fuzzy programming approach to multicriteria decision making transportation problem, Degeneracy graphs: Theory and applications. An updated survey, Pivot rules for linear programming: A survey on recent theoretical developments, A strictly improving linear programming Phase I algorithm, Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set, Inference flexibility in Horn clause knowledge bases and the simplex method, Fuzzy potential solutions in multi-criteria and multi-constraint level linear programming problems, Determination of the efficient set in multiobjective linear programming, Economic disequilibrium by mathematical programming, Piecewise lexicographic programming: A new model for practical decision problems, Conditions for the uniqueness of the optimal solution in linear semi- infinite programming, Probabilistic constraints in primal and dual linear programs: Duality results, Continuous linear complementarity problem, On a class of iterative projection and contraction methods for linear programming, Adjacent vertex simplex algorithms: More experimental results on random problems, On the Dietrich-Escudero approach for solving the $0-1$ knapsack problem with a $0-1$ objective function, Entropy of natural languages: Theory and experiment, Convex programs with an additional constraint on the product of several convex functions, Extensions of the potential reduction algorithm for linear programming, $k$-violation linear programming, A feasible descent cone method for linearly constrained minimization problems, The simplex algorithm with a new primal and dual pivot rule, A branch and bound algorithm for solving separable convex integer programming problems, Scaling, shifting and weighting in interior-point methods, Random problem genertion and the computation of efficient extreme points in multiple objective linear programming, On the complexity of some basic problems in computational convexity. I. Containment problems, On the Nipp polyhedron algorithm for solving singular perturbation problems, An analytic symmetrization of max flow-min cut, On linear programming and matrix scaling over the algebraic numbers, Competitive equilibrium in an exchange economy with indivisibilities, 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, 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., Characterizing the Delaunay decompositions of compact hyperbolic surfaces, Analyzing the potential of a firm: an operations research approach., 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, A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints, $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, A tutorial history of least squares with applications to astronomy and geodesy, 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, 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, A phase-1 approach for the generalized simplex algorithm, Cycling in linear programming problems, Group scheduling with controllable setup and processing times: minimizing total weighted completion time, 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, 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, Fair transfer price and inventory holding policies in two-enterprise supply chains, An asymptotic simplex method for singularly perturbed linear programs, Satisficing solutions and duality in interval and fuzzy linear programming, Blending simple polytopes at faces, Game theoretic models for climate change negotiations, Cascading-heuristics for the solution of staircase linear programs, A branch and bound network approach to the canonical constrained entropy problem, 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, A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices, The implementation of linear programming algorithms based on homotopies, Core theory for multiple-sided assignment games, Nonrevisiting paths on surfaces, A sublinear-time randomized approximation algorithm for matrix games, Modified fictitious play for solving matrix games and linear-programming problems, Infinite networks: Minimal cost flows, Linear time algorithms for linear programming, Solving a class of multiplicative programs with 0-1 knapsack constraints, Computational results with a primal-dual subproblem simplex method, A direct heuristic algorithm for linear programming, A projective simplex algorithm using LU decomposition, The enumeration of minimal phylograms, GENGUB: A generator for linear programs with generalized upper bound constraints, Flexible contingency plans in optimal linear designs, Heights of convex polytopes, A fresh view on the tolerance approach to sensitivity analysis in linear programming, Computer-based algorithms for multiple criteria and multiple constraint level integer linear programming, Über das Transportproblem mit beliebigen zusätzlichen linearen Nebenbedingungen, Chebyshev solution of large linear systems, A comparison of primal and dual methods of linear programming, On the continuity of the minimum set of a continuous function, Discrete search and the Neyman-Pearson lemma, Complementary pivot theory of mathematical programming, A duality theory for abstract mathematical programs with applications to optimal control theory, Some remarks on a Markovian decision problem with an absorbing state, The $d$-step conjecture for polyhedra of dimension $d<6$, A dynamic programming solution to integer linear programs, A decision rule in the simplex method that avoids cycling, Special simplex algorithm for multi-sector problems, Some duality relationships for the generalized Neyman-Pearson problem, Algorithms for some minimax problems, Linear programming algorithms for semi-Markovian decision processes, An economic interpretation of duality in linear programming, On the optimum synthesis of statistical communication nets - pseudo parametric techniques, A combinatorial approach to convex quadratic programming, Numerical computational methods of optimisation in control, The longest path in a network, Heuristically guided search and chromosome matching, Analysis and design of communication networks with memory, An interval programming algorithm for discrete linear $L_ 1$ approximation problems, A simplex method for zero-one mixed integer linear programs, Existence theory for the complex linear complementarity problem, A suboptimization method for interval linear programming: A new method for linear programming, Limit analysis of continuous media with piecewise linear yield condition, Perron-Frobenius properties of $Ax-\lambda Bx$, Optimal quasi-stationary periodic processes, Cutting plane algorithms and state space constrained linear optimal control problems, Generalized Benders decomposition, Linear programs in topological vector spaces, The assignment game. I: The core, Bounds for the error of linear systems of equations using the theory of moments, Limit analysis of plates with piecewise linear yield surface, On the number of solutions to the complementarity problem and spanning properties of complementary cones, Duality theorems for a class of nonconvex programming problems, The simplex algorithm with the pivot rule of maximizing criterion improvement, A numerically stable form of the simplex algorithm, Approximate solutions and error bounds for quasilinear elliptic boundary value problems, Optimization of Space Station components using design code CometBoards, Stochastic programming approaches to stochastic scheduling, Duality in mathematics and linear and integer programming, An efficient linear model and optimisation algorithm for multi-site combined heat and power production, The allocation of shared fixed costs, Sensitivity analysis in linear optimization: invariant support set intervals, Minimum-distance controlled perturbation methods for large-scale tabular data protection, Mixed integer models for the stationary case of gas network optimization, George B. Dantzig: a legendary life in mathematical programming, Game-theoretic analysis of an ancient Chinese horse race problem, Adaptive methods for solvings minimax problems^∗, A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees, An exposition of the (linear) complementarity problem, Generalized Markovian decision processes, An operator theory of parametric programming for the transportation problem-I, On scaling linear programs—some experimental results, On the generation and optimization of equivalent ladder networks, Primal transportation and transshipment algorithms, A bump triangular dynamic factorization algorithm for the simplex method, The cyclic method of solving the transshipment problem with an additional linear constraint, An economic interpretation of stochastic programs, Computational experience on an algorithm for the transportation problem with nonlinear objective functions, Un algoritmo para el problema de maxima entropia en el caso discreto, Multirate digital filters, Aplicabilidad de la programacion matematica en la estimacion de funciones discriminantes, Stochastic programming and stochastic control, A decomposition principle for a generalized linear and piece-wise linear program, Equalities in transportation problems and characterizations of optimal solutions, Characterization of facets for multiple right-hand choice linear programs, Analisis de estrategias en el ajuste lineal de funciones no-lineales en problemas de optimizacion, A linear programming model for design of communications networks with time varying probabilistic demands, Duality relationships between a class of graphs and linear programs, Entropy in linear programs, A Polynomial Method of Weighted Centers for Convex Quadratic Programming, The threshold weight of a graph, Multivariable gain margin, Stochastic linear programming method for right-hand sides random vector, A simplex-like method with bisection for linear programming¹, LINEAR PROGRAMMING AND RECURRENT ASSOCIATIVE MEMORIES, Solution and investigation of one class of inexact integer programming problems, A quasi-polynomial bound for the diameter\\of graphs of polyhedra, An unconstrained convex programming view of linear programming, One-point suspensions and wreath products of polytopes and spheres, Constructing efficient solutions structure of multiobjective linear programming, The binary search decomposition in a decentralized organization, The worst-case running time of the random simplex algorithm is exponential in the height, Extension of GAMS for complementarity problems arising in applied economic analysis, Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution, A genuinely polynomial primal simplex algorithm for the assignment problem, On the equivalence of the simplex methods and a multiplier-alike method for linear programming, An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6., A dual projective simplex method for linear programming, Search-hide games on trees, An O(n) algorithm for discrete n-point convex approximation with applications to continuous case, Worst case behavior of the steepest edge simplex method, An efficient curvilinear method for the minimization of a nonlinear function subject to linear inequality constraints, A property of certain multistage linear programs and some applications, Location of a discrete resource and its allocation according to a fractional objective, Existence of optimal Lagrange multipliers for certain nonconvex allocation problems, Optimal simplex tableau characterization of unique and bounded solutions of linear programs, Piecewise linear optimization, Implementation and analysis of a variant of the dual method for the capacitated transshipment problem, Levelling terrain trees: A transshipment problem, Related necessary conditions for completing partial latin squares, Distributed-parameter optimal control via mathematical programming, A cutting-plane algorithm with linear and geometric rates of convergence, Permanental polytopes of doubly stochastic matrices, Connected level sets, minimizing sets and uniqueness in optimization, Computer experiments on quadratic programming algorithms, Perron eigenvectors and the symmetric transportation polytope, Parametric simplex algorithms for solving a special class of nonconvex minimization problems, A new approach to uncertain parameter linear programming, Necessary and sufficient conditions for balancedness in partitioning games, Temporal constraint networks, A dual algorithm for submodular flow problems, Solution of projection problems over polytopes, A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming, A survey of multiple sequence comparison methods, Linear programming, recurrent associative memories, and feed-forward neural networks, A geometric view of parametric linear programming, Location and sizing of offshore platforms for oil exploration, An O($n$) bound for the diameter of transshipment polytopes, The generalized simplex method, Upper bounds for the diameter and height of graphs of convex polyhedra, Constructing a stochastic critical path network given the slacks: Representation, Coflow polyhedra, An alternative approach to the refined duality theory of geometric programming, The history of the application of mathematical programming to menu planning, Algorithms for the single-source uncapacitated minimum concave-cost network flow problem, Deriving conclusions in expert systems when knowledge is incomplete, Selecting optimal linear production systems in multiple criteria environments, On symmetric subtour problems, On subsidiary problems in geometric programming, Description of the optimal solution set of the linear programming problem and the dimension formula, A unified approach to complementarity in optimization, The continuity of the optimum in parametric programming and applications to stochastic programming, Polytope pairs and their relationship to linear programming, Programmazione lineare con piu funzioni obiettivo, The generalized inverse in parametric programming, Auctioning Böhm-Bawerk's horses, A quasi-linear programming algorithm for optimising fibre-reinforced structures of fixed stiffness, The set of all nondominated solutions in linear cases and a multicriteria simplex method, Application of optimization methods to the hematological support of patients with disseminated malignancies, Linear programming techniques for multidimensional analysis of preferences, Nonlinear programming approach to optimal scaling of partially ordered categories, Fourier-Motzkin elimination extension to integer programming problems, Multilevel stabilization of large-scale systems: A spinning flexible spacecraft, On the computation of plastic stress-strain relations for polycrystalline metals, Convex polyhedra of doubly stochastic matrices. II: Graph of Omega sub(n), Existence and representation of Diophantine and mixed Diophantine solutions to linear equations and inequalities, Convex polyhedra of doubly stochastic matrices. IV, Termination of reactions in chemical systems specified by mass-balance reaction formulas, The free parametrization for linear programming with bounded variables, Solving a system of linear inequalities for generating test data, Optimum design for work-hardening adaptation, Minimal cost in elasto-plastic structures, A facilities in series capacity constrained dynamic lot-size model, Allocation of resources according to a fractional objective, Number of operations for updating the elimination form of the basis- inverse of the revised simplex-algorithm, A geometrical interpretation of the Hungarian method, Solving singularly constrained generalized network problems, A combinatorial abstraction of linear programming, A primal algorithm for interval linear-programming problems, On the use of tree indexing methods in transportation algorithms, On condensed geometric programming in structural optimisation, An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality, Algorithmic equivalence in quadratic programming. I. A least-distance programming problem, An evaluation of mathematical programming and minicomputers, Computing an interior point for inequalities using linear optimization, Bounds for sorting by prefix reversal, Uniqueness of solution in linear programming, A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems, Method of optimum control, A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality, Kuhn-Tucker multipliers as trade-offs in multiobjective decision-making analysis, A Newton-type curvilinear search method for constrained optimization, Efficient search for rationals, Hidden Z-matrices with positive principal minors, On removing a vertex from the assignment polytope, Algebraic languages for mathematical programming, Multi-parametric analysis of the maximum tolerance in a linear programming problem, A decision model for interdependent information system project selection, Formulae for theL₀,L₁andL_∞Norms, Survey of linear programming for standard and nonstandard Markovian control problems. Part I: Theory, Dual contingency plans in optimal generalized linear designs, A Variant of the Dual Pivoting Rule in Linear Programming, Generalized cross decomposition applied to nonlinear integer programming problems: duality gaps and convexification in parts, Some generalizations of the criss-cross method for quadratic programming, The general quadratic optimization problem, Homotopies for computation of fixed points, On pricing and backward transformation in linear programming, A primal‐dual interior-point method for linear optimization based on a new proximity function, Column-Generation in Integer Linear Programming, Tabu Search for Vehicle Routing Problems (VRPs), Unnamed Item, POSITIVE SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING, Scheduling and routing algorithms for AGVs: A survey, Fourier-Motzkin elimination method in MOLP problems, A New Algorithm To Solve Vehicle Routing Problems (VRPs), The theory of linear programming:skew symmetric self-dual problems and the central path^*, Die Behandlung von Entscheidungsproblemen mit Hilfe des Dynamischen Programmierens, Mathematical programming applied to load flow calculations, Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems, An extension of the frank and Wolfe method of feasible directions, On the two-level planning procedure under a Dantzig-Wolfe decomposition†, Extreme point linear fractional functional programming, ON A THEOREM OF NEGISHI, A column generation algorithm for nonlinear programming, Toward faster algorithms for dynamic traffic assignment. I. Parametric quickest‐path trees, Unnamed Item, A NEW APPROACH TO FINDING OPTIMAL LINEAR SCHEDULES FOR UNIFORM DEPENDENCE ALGORITHMS†, Basis characterisation for linear multicommodity network programs, Sensitivity analysis revisited: changing input-output coefficients of a basic activity, A simple modification of dantzig-wolfe decomposition, On the length of primal-dual projection of potential reduction algorithm, Unnamed Item, Numerical treatment of a class of semi‐infinite programming problems, Juegos parametricos, Linear programming with entropic perturbation, ON THE PROPERTIES OF ∊-SENSITIVITY ANALYSIS FOR LINEAR PROGRAMMING, Zurückführung eines sortenproblems auf das dreidimensionale transportproblem, Programming under uncertainty: The complete problem, Unnamed Item, Unnamed Item, Stochastic Programming, Error control in the simplex-technique, Das zweistufige Problem der stochastischen linearen Programmierung, On stochastic linear programming distribution problems, stochastic technology matrix, Statistical decision analysis of stochastic linear programming problems, Optimality conditions and an algorithm for linear-quadratic bilevel programs$fr1:¹$f:¹partially supported by nsfc and madis. this paper was prepared during the first author's visiting universitat de barcelona. he is grateful to the financial support provided by universitat de barcelona. the authors are very grateful to the referees for their valuable suggestions and comments, On Linear Semi-Infinite Programming Problems: An Algorithm, On the existence of optimal solutions to integer and mixed-integer programming problems, ALGORITHMS FOR OPTIMIZATION OF POWER SYSTEMS SCHEDULES BASED ON THE SIMPLEX METHOD, Efficient computational devices for the capacitated transportation problem, Nested decomposition for dynamic models, On the application of deterministic and stochastic programming methods to problems of economics;Mathematische Programmierung und ihre Anwendung auf die Wirtschaft, Solution of generalized geometric programs, An Operator Theory for a Class of Linear Fractional Programming Problems — I, Disjoint paths in a network, A mean cost approximation for transportation problems with stochastic demand, Parametric studies in transportation-type problems, Break minimization, An operator theory of parametric programming for the generalized transportation problem: I. Basic theory, An operator theory of parametric programming for the generalized transportation problem: II Rim, cost and bound operators, An operator theory of parametric programming for the generalized transportation problem-III-weight operators, An operator theory of parametric programming for the generalized transportation problem—IV—global operators, An improved version of the out-of-kilter method and a comparative study of computer codes, Optimal production growth for the machine loading problem, The travelling salesman problem and a class of polyhedra of diameter two, A central cutting plane algorithm for the convex programming problem, A finite algorithm to maximize certain pseudoconcave functions on polytopes, An efficient scaling procedure for gain networks, On Markov games, Personnel assignment by multiobjective programming, Optimal design of a multi‐item, multi‐location, multi‐repair type repair and supply system, Maximum flow in probabilistic graphs-the discrete case, On the application of degree theory to the analysis of resistive nonlinear networks, Concepts of optimality and their uses, Optimal antithetic sampling plans, A dual decomposition algorithm, Approximate cutting planes in nonlinear programming, The zero pivot phenomenon in transportation and assignment problems and its computational implications, Linear complementarity problems solvable by A single linear program, Stress-unilateral analysis of discretized cable and membrane structure in the presence of large displacements, Unnamed Item, A note on the primal-dual and out-of-kilter algorithms for network optimization problems, A generalized upper bounding algorithm for large-scale generalized goal programming problems, Compact LP bases for a class of IP problems, Computing bounds for the optimal value in linear programming, On some relations between a dual pair of multiple objective linear programs, Decomposition of arborescent linear programs, Optimal flows in nonlinear gain networks, Network topology and integral multicommodity flow problems, Solving the Generalized Transportation Problem with Constraints, The simplex method for integral multicommodity networks, Solving the Generalized Transportation Problem with Constraints, A New Algorithm for the Chebyshev Solution of Overdetermined Linear Systems, A streamlined simplex approach to the singly constrained transportation problem, The enumeration of all efficient solutions for a linear multiple-objective transportation problem, Minimum energy problem for discrete linear admissible control systems, Queuing effects in the solution of constrained store-and-forward network flow problems, Input design for linear dynamic systems using maxmin criteria, Unnamed Item, Unnamed Item, Linear programming under uncertainty: A basic property of the optimal solution, Qualitative Aussagen zu einigen Problemen der stochastischen Programmierung, THE USE OF PRIOR INFORMATION IN ESTIMATING THE PARAMETERS OF ECONOMIC RELATIONSHIPS, Function restoration using linear programming†, Basic feasible solutions and decomposition principle for linear fractional functionals programming problem, Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers, Nota sobre programacion lineal estocastica: Evolucion y estado actual. (I), Hybrid programs: Linear and least-distance, An efficient algorithm for minimizing barrier and penalty functions, On the solution of linear equation/inequality systems, A fundamental problem in linear inequalities with applications to the travelling salesman problem, Quadratic programming with quadratic constraints, The payment scheduling problem, Sortie aspects of stochastic economics, Some continuous functions related to corner polyhedra, II, A projective method for structured nonlinear programs, A squared‐variable transformation approach to nonlinear programming optimality conditions, Determining optimal growth paths in logistics operations, A generalized upper bounding algorithm for multicommodity network flow problems, Duality in Quadratic Programming, Deux algorithmes de programmation mathématique, A mathematical programming approach to identification and optimization of a class of unknown systems, On the equivalence of some generalized network problems to pure network problems, Parametric analysis of linear programs with upper bounded variables, Some Results on Sparse Matrices, A contextualized historical analysis of the Kuhn-Tucker theorem in nonlinear programming: The impact of World War II, The complexity of linear programming, Positively regular vague matrices, A determinantal lower bound, On the core of transportation games, Measuring conformability of probabilities, Analysis of the potential for spatial redistribution of freight using mathematical programming, Fractional programming approach to fuzzy weighted average., A model for the global optimization of water prices and usage for the case of spatially distributed sources and consumers, On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions, A method of transferring polyhedron between the intersection-form and the sum-form, The emergence of nonlinear programming: interactions between practical mathematics and mathematics proper., Single machine batch scheduling with resource dependent setup and processing times