The following pages link to Mathematical Programming (Q59162):
Displaying 50 items.
- The polynomial hierarchy and a simple model for competitive analysis (Q3716806) (← links)
- On constraint sets of infinite linear programs over ordered fields (Q3716808) (← links)
- ‘Fat’ triangulations, or solving certain nonconvex matrix optimization problems (Q3716828) (← links)
- On Fan's minimax theorem (Q3717690) (← links)
- Binary group and Chinese postman polyhedra (Q3717740) (← links)
- On box totally dual integral polyhedra (Q3717741) (← links)
- Newton's method for constrained optimization (Q3718491) (← links)
- Input optimization: I. Optimal realizations of mathematical models (Q3718494) (← links)
- Improved algorithm for mixed-integer quadratic programs and a computational study (Q3720300) (← links)
- On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem (Q3720303) (← links)
- Even more with the Lemke complementarity algorithm (Q3720322) (← links)
- An implementation of a discretization method for semi-infinite programming (Q3722265) (← links)
- Some comments on Wolfe's ‘away step’ (Q3722278) (← links)
- On extremal points of quasiconvex functions (Q3723189) (← links)
- A PL homotopy continuation method with the use of an odd map for the artificial level (Q3723607) (← links)
- A finite algorithm for the continuousp-center location problem on a graph (Q3724065) (← links)
- A nonlinear equation for linear programming (Q3724087) (← links)
- On linear programs with random costs (Q3724096) (← links)
- Affirmative action algorithms (Q3725860) (← links)
- A class of convergent primal-dual subgradient algorithms for decomposable convex programs (Q3725884) (← links)
- A note on degeneracy in linear programming (Q3730338) (← links)
- A competitive (dual) simplex method for the assignment problem (Q3730345) (← links)
- A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities (Q3730348) (← links)
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization (Q3730358) (← links)
- A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm (Q3731344) (← links)
- A simple constraint qualification in infinite dimensional programming (Q3731366) (← links)
- Global minimization of large-scale constrained concave quadratic problems by separable programming (Q3731373) (← links)
- A successive quadratic programming algorithm with global and superlinear convergence properties (Q3731379) (← links)
- A relaxed projection method for variational inequalities (Q3732440) (← links)
- On the continuity of a Lagrangian multiplier function in input optimization (Q3733649) (← links)
- Continuity of the null space basis and constrained optimization (Q3734171) (← links)
- An algorithm for finding the global maximum of a multimodal, multivariate function (Q3734174) (← links)
- A recursive quadratic programming algorithm that uses differentiable exact penalty functions (Q3734178) (← links)
- Broyden's method in Hilbert space (Q3734179) (← links)
- On the average length of lexicographic paths (Q3735459) (← links)
- A regularized decomposition method for minimizing a sum of polyhedral functions (Q3735489) (← links)
- Critical sets in parametric optimization (Q3735499) (← links)
- Solving multiple criteria problems by interactive decomposition (Q3735500) (← links)
- On the stability of Invariant Capital Stock in a two-dimensional planning model (Q3738845) (← links)
- The Manne-Chao-Wilson algorithm for computing competitive equilibria: A modified version and its implementation (Q3738859) (← links)
- Parallel variable metric algorithms for unconstrained optimization (Q3738945) (← links)
- Network design problem with congestion effects: A case of bilevel programming (Q3741367) (← links)
- Linear complementarity problems with an invariant number of solutions (Q3743139) (← links)
- A generalized linear production model: A unifying model (Q3743164) (← links)
- A convex-like duality scheme for quasi-convex programs (Q3744776) (← links)
- Characterizing an optimal input in perturbed convex programming: Corrigendum (Q3745634) (← links)
- Worst-case analysis of the differencing method for the partition problem (Q3750527) (← links)
- Piecewise-linear programming: The compact (CPLP) algorithm (Q3754440) (← links)
- Nonlinear programming and stationary strategies in stochastic games (Q3754523) (← links)
- Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm (Q3755229) (← links)
