The following pages link to Linear Programming (Q4421881):
Displaying 50 items.
- Algebraic simplex initialization combined with the nonfeasible basis method (Q319588) (← links)
- New characterizations for largeness of the core (Q380864) (← links)
- Measurement of returns to scale using a non-radial DEA model (Q416965) (← links)
- Using dual presolving reductions to reformulate cumulative constraints (Q487651) (← links)
- Network equilibrium of production, transportation and pricing for multi-product multi-market (Q510439) (← links)
- Relational linear programming (Q511779) (← links)
- Finding complex balanced and detailed balanced realizations of chemical reaction networks (Q543518) (← links)
- Greatest remainder bi-proportional rounding and the Greek parliamentary elections of 2007 (Q547998) (← links)
- Fuzzy linear programming approach for solving fuzzy transportation problems with transshipment (Q662131) (← links)
- On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes (Q713305) (← links)
- Characterizing the universal rigidity of generic frameworks (Q741616) (← links)
- On Hoffman's celebrated cycling LP example (Q875416) (← links)
- An overview on the simplex algorithm (Q1021548) (← links)
- Risk optimization with \(p\)-order conic constraints: a linear programming approach (Q1038319) (← links)
- A chance constrained approach to fractional programming with random numerator (Q1043364) (← links)
- Linear programming: foundations and extensions (Q1352549) (← links)
- A strongly polynomial contraction-expansion algorithm for network flow problems (Q1652310) (← links)
- Convergence conditions for the observed mean method in stochastic programming (Q1745693) (← links)
- Sliding-MOMP based channel estimation scheme for ISDB-T systems (Q1793180) (← links)
- Fuel and energy system control at large-scale damages. II: Optimization problems (Q1795621) (← links)
- A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption (Q1944927) (← links)
- Non-Archimedean zero-sum games (Q2020543) (← links)
- Relationship of two formulations for shortest bibranchings (Q2024606) (← links)
- Fuzzy best-worst method based on triangular fuzzy numbers for multi-criteria decision-making (Q2056357) (← links)
- The algorithmic numbers in non-Archimedean numerical computing environments (Q2057688) (← links)
- The minimum mean cycle-canceling algorithm for linear programs (Q2076908) (← links)
- Minimum \(t\)-spanners on subcubic graphs (Q2154116) (← links)
- Duality of graph invariants (Q2193958) (← links)
- Modeling tau transport in the axon initial segment (Q2207163) (← links)
- The big-M method with the numerical infinite \(M\) (Q2230778) (← links)
- A novel approach for solving rough multi-objective transportation problem: development and prospects (Q2244965) (← links)
- Measurement of returns to scale using non-radial DEA models (Q2255989) (← links)
- An application of a Lagrangian-type relaxation for the uncapacitated facility location problem (Q2257610) (← links)
- A radial boundary intersection aided interior point method for multi-objective optimization (Q2282318) (← links)
- Polynomial-time computation of exact correlated equilibrium in compact games (Q2347787) (← links)
- Dispatch planning using newsvendor dual problems and occupation times: application to hydropower (Q2355074) (← links)
- Measurement of returns to scale in radial DEA models (Q2357120) (← links)
- Flyspeck II: The basic linear programs (Q2379683) (← links)
- Evaluating green suppliers: improving supplier performance with DEA in the presence of incomplete data (Q2418165) (← links)
- A BSSS algorithm for the single facility location problem in two regions with different norms (Q2482820) (← links)
- George B. Dantzig: a legendary life in mathematical programming (Q2583150) (← links)
- Concave programming for finding sparse solutions to problems with convex constraints (Q3096890) (← links)
- (Q3160276) (← links)
- An Embarrassingly Parallel Method for Large-Scale Stochastic Programs (Q3296384) (← links)
- Production Dependent Agricultural 3D Transportation Problem with Maximization of Annual Net Profit in Generalized Intuitionistic Fuzzy Environment (Q3297307) (← links)
- (Q4225802) (← links)
- A constructive way to compute the Tarski number of a group (Q4566075) (← links)
- New computations of the superbridge index (Q4965613) (← links)
- Vector Space Decomposition for Solving Large-Scale Linear Programs (Q4971568) (← links)
- New superbridge index calculations from non-minimal realizations (Q5044437) (← links)
