The following pages link to Mathematical Programming (Q59162):
Displaying 50 items.
- On accelerating PL continuation algorithms by predictor—corrector methods (Q3934152) (← links)
- Existence and characterization of efficient decisions with respect to cones (Q3934164) (← links)
- On optimality conditions for structured families of nonlinear programming problems (Q3936518) (← links)
- A critical index algorithm for nearest point problems on simplicial cones (Q3937160) (← links)
- Polyhedral polarity defined by a general bilinear inequality (Q3937166) (← links)
- Combining a path method and parametric linear programming for the computation of competitive equilibria (Q3938798) (← links)
- On random quadratic bottleneck assignment problems (Q3938840) (← links)
- Optimal scaling of balls and polyhedra (Q3938841) (← links)
- A bundle type approach to the unconstrained minimization of convex nonsmooth functions (Q3938844) (← links)
- Criteria for quasi-convexity and pseudo-convexity: Relationships and comparisons (Q3938845) (← links)
- Axiomatic approach to statistical models and their use in multimodal optimization theory (Q3939608) (← links)
- Optimal sharing (Q3941156) (← links)
- Dynamically restricted pricing in the simplex method for linear programming (Q3941191) (← links)
- The value function of an integer program (Q3941194) (← links)
- A note on a sufficient-decrease criterion for a non-derivative step-length procedure (Q3941205) (← links)
- Conjugate direction methods with variable storage (Q3941206) (← links)
- An extension of the edge covering problem (Q3941210) (← links)
- Some perturbation results for the Linear Complementarity Problem (Q3944363) (← links)
- Some facets of the simple plant location polytope (Q3945954) (← links)
- A mathematical programming approach for determining oligopolistic market equilibrium (Q3947414) (← links)
- Polynomially bounded algorithms for locatingp-centers on a tree (Q3947422) (← links)
- Solving staircase linear programs by the simplex method, 1: Inversion (Q3948887) (← links)
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach (Q3948895) (← links)
- Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems (Q3950322) (← links)
- Evaluating computational efficiency: A stochastic approach (Q3951477) (← links)
- Worst case analysis of a class of set covering heuristics (Q3951908) (← links)
- Solving the subproblem in the lagrangian dual of separable discrete programs with linear constraints (Q3951912) (← links)
- Random polytopes: Their definition, generation and aggregate properties (Q3953557) (← links)
- Cyclic subgradient projections (Q3953572) (← links)
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases (Q3955153) (← links)
- Solution techniques for some allocation problems (Q3955156) (← links)
- Convex infinite horizon programs (Q3956749) (← links)
- Global saddle-point duality for quasi-concave programs, II (Q3956750) (← links)
- An efficient simplicial algorithm for computing a zero of a convex union of smooth functions (Q3956756) (← links)
- A note on the Talman, Van der Heyden linear complementarity algorithm (Q3956765) (← links)
- Polyhedral extensions of some theorems of linear programming (Q3959739) (← links)
- A method to increase the computational efficiency of certain quadratic programming algorithms (Q3959745) (← links)
- ε-Optimal solutions in nondifferentiable convex programming and some related questions (Q3959749) (← links)
- A dual differentiable exact penalty function (Q3959752) (← links)
- A new variable dimension algorithm for the fixed point problem (Q3959753) (← links)
- Consistency of finite systems of convex inequalities (Q3959758) (← links)
- Note on the path following approach of equilibrium programming (Q3962743) (← links)
- A note on the existence of subgradients (Q3962785) (← links)
- Pivotal methods for computing equilibrium points: Unified approach and new restart algorithm (Q3962790) (← links)
- Penalty methods for computing points that satisfy second order necessary conditions (Q3962792) (← links)
- Duality in vector optimization (Q3962798) (← links)
- Updated triangular factors of the working basis in winkler's decomposition approach (Q3964320) (← links)
- A Lipschitz constant associated with lemke's closest-point principle (Q3964330) (← links)
- Iterative methods for variational and complementarity problems (Q3965925) (← links)
- The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm (Q3967334) (← links)
