Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming
From MaRDI portal
Publication:5848623
DOI10.2307/1907876zbMath0064.39501OpenAlexW2003662390MaRDI QIDQ5848623
Publication date: 1955
Published in: Econometrica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1907876
Related Items
The value of the stochastic solution in stochastic linear programs with fixed recourse, Solving stochastic programs with simple recourse, Unnamed Item, Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution, On proximal augmented Lagrangian based decomposition methods for dual block-angular convex composite programming problems, A projective method for structured nonlinear programs, A partitioning algorithm for the multicommodity network flow problem, Analysis of budget for interdiction on multicommodity network flows, On classifying decision making units in DEA: a unified dominance-based model, Relaxed Dual simplex Approach for Bounded Variable Linear programs, Lineare Ersatzprogramme für unscharfe Entscheidungsprobleme Zur Optimumbestimmung bei unscharfer Problembeschreibung, Über das Transportproblem mit beliebigen zusätzlichen linearen Nebenbedingungen, Column-Generation in Integer Linear Programming, Upper bound problem in linear fractional functionals programming, A suboptimization method for interval linear programming: A new method for linear programming, A Method for Bounded Variable Linear Programs Using One Upper Bound Constraint Only, Beiträge zur Dekomposition von linearen Programmen, George B. Dantzig: a legendary life in mathematical programming, Solving staircase linear programs by the simplex method, 1: Inversion, Identifying the Global Reference Set in DEA: An Application to the Determination of Returns to Scale, Bi-objective capacitated transportation problem with bounds over distributions and requirement capacities, Implementation of a Double-Basis Simplex Method for the General Linear Programming Problem
