The following pages link to Mathematical Programming (Q59162):
Displaying 50 items.
- Nonlinear programming via an exact penalty function: Global analysis (Q3967372) (← links)
- Nonlinear programming via an exact penalty function: Asymptotic analysis (Q3967373) (← links)
- The value of the stochastic solution in stochastic linear programs with fixed recourse (Q3968764) (← links)
- Subgradient optimization applied to a discrete nonlinear problem in engineering design (Q3968774) (← links)
- Minimality and complementarity properties associated with Z-functions and M-functions (Q4042851) (← links)
- A simplicial algorithm for the nonlinear complementarity problem (Q4042852) (← links)
- Classes of functions and feasibility conditions in nonlinear complementarity problems (Q4042853) (← links)
- Local convergence in Fermat's problem (Q4042858) (← links)
- On the existence of optimal solutions to integer and mixed-integer programming problems (Q4044365) (← links)
- Coefficient reduction for inequalities in 0–1 variables (Q4044367) (← links)
- A cost function property for plant location problems (Q4044368) (← links)
- Implicit function theorems for mathematical programming and for systems of inequalities (Q4045878) (← links)
- Nested decomposition for dynamic models (Q4047383) (← links)
- Comments on the note of Frieze (Q4047390) (← links)
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms (Q4047415) (← links)
- Determining GUB sets via an invert agenda algorithm (Q4048848) (← links)
- A bilinear programming formulation of the 3-dimensional assignment problem (Q4050393) (← links)
- Fenchel and Lagrange duality are equivalent (Q4050398) (← links)
- Note on a method of conjugate subgradients for minimizing nondifferentiable functions (Q4050401) (← links)
- Various definitions of the derivative in mathematical programming (Q4050405) (← links)
- Optimal flows in networks with multiple sources and sinks (Q4050411) (← links)
- A greedy algorithm for solving a certain class of linear programmes (Q4051883) (← links)
- A numerical method for a class of continuous concave programming problems (Q4051908) (← links)
- Newton-type methods for unconstrained and linearly constrained optimization (Q4051917) (← links)
- On the selection of parameters in Self Scaling Variable Metric Algorithms (Q4051920) (← links)
- A set intersection theorem and applications (Q4051927) (← links)
- A relaxation method for reconstructing objects from noisy X-rays (Q4053008) (← links)
- A complementary variant of Lemke's method for the linear complementary problem (Q4053380) (← links)
- A note on column generation in Dantzig—Wolfe decomposition algorithms (Q4053382) (← links)
- On interior and convexity conditions, development of dual problems and saddlepoint optimality criteria in abstract mathematical programming (Q4055387) (← links)
- Modified regularity conditions for nonlinear programming problems over mixed cone domains (Q4055388) (← links)
- New results on equivalent integer programming formulations (Q4058477) (← links)
- Quasi-balanced matrices (Q4060720) (← links)
- Degeneracy in fixed cost transportation problems (Q4060725) (← links)
- Projection methods for non-linear programming (Q4060749) (← links)
- A “from scratch” proof of a theorem of Rockafellar and Fulkerson (Q4061086) (← links)
- A branch and bound algorithm for the generalized assignment problem (Q4066849) (← links)
- Break minimization (Q4066851) (← links)
- An alternate implementation of Goldfarb's minimization algorithm (Q4068458) (← links)
- Optimization algorithms and point-to-set-maps (Q4070640) (← links)
- A new algorithm for the solution of multi-state dynamic programming problems (Q4071041) (← links)
- An improved version of the out-of-kilter method and a comparative study of computer codes (Q4073126) (← links)
- On a general saddle-point condition in normed spaces (Q4073133) (← links)
- Improved integer programming bounds using intersections of corner polyhedra (Q4074667) (← links)
- Vertex packings: Structural properties and algorithms (Q4074668) (← links)
- Resolution of the 0–1 knapsack problem: Comparison of methods (Q4074670) (← links)
- Faces for a linear inequality in 0–1 variables (Q4074671) (← links)
- Facet of regular 0–1 polytopes (Q4074672) (← links)
- Experimental results on Hillier's linear search (Q4074674) (← links)
- A monotonic passy-like algorithm for the modular design problem (Q4074694) (← links)
