The following pages link to Mathematical Programming (Q59162):
Displaying 50 items.
- Minimal inequalities (Q3879045) (← links)
- A note on the convergence of an algorithm for nonconvex programming problems (Q3879055) (← links)
- On conditions to have bounded multipliers in locally lipschitz programming (Q3879060) (← links)
- A note on perfect duality and limiting lagrangeans (Q3880596) (← links)
- A new subdivision for computing fixed points with a homotopy algorithm (Q3880620) (← links)
- Second-order conditions for an exact penalty function (Q3883398) (← links)
- On optimizing functions which are defined in part by an approximation process (Q3883920) (← links)
- Variable metric methods for minimizing a class of nondifferentiable functions (Q3883929) (← links)
- A method for globally minimizing concave functions over convex sets (Q3883930) (← links)
- Combined lp and quasi-Newton methods for minimax optimization (Q3883931) (← links)
- Elimination of bounds in optimization problems by transforming variables (Q3883932) (← links)
- Degenerate complementary cones induced by aK 0-matrix (Q3883935) (← links)
- A parametric linear complementarity technique for the computation of equilibrium prices in a single commodity spatial model (Q3883939) (← links)
- A class of simplicial restart fixed point algorithms without an extra dimension (Q3883945) (← links)
- A dual method for discrete Chebychev curve fitting (Q3885510) (← links)
- New criteria for the simplex algorithm (Q3885511) (← links)
- A degeneracy exploiting LU factorization for the simplex method (Q3885512) (← links)
- Feasible direction methods for stochastic programming problems (Q3885533) (← links)
- Two stage linear programming under uncertainty with 0–1 integer first stage variables (Q3885534) (← links)
- About a minimax theorem of Matthies, Strang and Christiansen (Q3885536) (← links)
- Shadow prices in nonconvex mathematical programming (Q3885539) (← links)
- Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems (Q3885546) (← links)
- A variable dimension algorithm for the linear complementarity problem (Q3885547) (← links)
- Completely- matrices (Q3885548) (← links)
- Bounds for aggregating nodes in network problems (Q3885553) (← links)
- A practicable steepest-edge simplex algorithm (Q3887219) (← links)
- A step toward probabilistic analysis of simplex method convergence (Q3887223) (← links)
- Computational complexity of parametric linear programming (Q3887263) (← links)
- On the convexifiability of pseudoconvex C2-functions (Q3888859) (← links)
- Scalar labelings for homotopy paths (Q3890015) (← links)
- Borsuk's theorem through complementary pivoting (Q3890454) (← links)
- Eliminating extraneous edges in Greenberg's algorithm (Q3892062) (← links)
- Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual (Q3892089) (← links)
- Connected and alternating vectors: Polyhedra and algorithms (Q3895223) (← links)
- A set of staircase linear programming test problems (Q3895224) (← links)
- Duality gaps in semi-infinite linear programming—an approximation problem (Q3895225) (← links)
- An equivalence between two algorithms for quadratic programming (Q3895232) (← links)
- Superlinear convergence of Broyden's boundedθ-class of methods (Q3895235) (← links)
- On some characterisations of totally unimodular matrices (Q3895600) (← links)
- A polynomially bounded algorithm for a singly constrained quadratic program (Q3899825) (← links)
- A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles (Q3899836) (← links)
- Homeomorphisms of triangulations with applications to computing fixed points (Q3899839) (← links)
- Infinite retrogression in the Eaves—Saigal algorithm (Q3899841) (← links)
- A note on quasi-newton formulae for sparse second derivative matrices (Q3901317) (← links)
- Least-index resolution of degeneracy in quadratic programming (Q3902831) (← links)
- A modified reduced gradient method for a class of nondifferentiable problems (Q3902833) (← links)
- Linear max-min programming (Q3905079) (← links)
- Integer programming duality: Price functions and sensitivity analysis (Q3908768) (← links)
- Entropy in linear programs (Q3911662) (← links)
- Polyhedra related to a lattice (Q3911666) (← links)
