default search action
Mathematical Programming, Volume 2
Volume 2, Number 1, February 1972
- Floyd J. Gould, Jon W. Tolle:
Geometry of optimality conditions and constraint qualifications. 1-18 - Claude Berge:
Balanced matrices. 19-31 - Claude-Alain Burdet:
Enumerative inequalities in integer programming. 32-64 - Leon S. Lasdon:
An efficient algorithm for minimizing barrier and penalty functions. 65-106 - S. Karamardian:
The complementarity problem. 107-129 - Thomas L. Magnanti:
Publications. 130-132 - Roger Fletcher:
An algorithm for solving linearly constrained optimization problems. 133-165 - Roger J.-B. Wets:
Characterization theorems for stochastic programs. 166-175 - Robert E. Pugh:
A language for nonlinear programming problems. 176-206 - Johan Philip:
Algorithms for the vector maximization problem. 207-229 - Olivier Pironneau, Elijah Polak:
On the rate of convergence of certain methods of centers. 230-257 - Philip Wolfe:
Explicit solution of an optimization problem. 258-260 - John J. H. Forrest, John A. Tomlin:
Updated triangular factors of the basis to maintain sparsity in the product form simplex method. 263-278 - Huibert Kwakernaak, R. C. W. Strijbos:
Extremization of functions with equality constraints. 279-295 - Katta G. Murty:
A fundamental problem in linear inequalities with applications to the travelling salesman problem. 296-308 - Mordecai Avriel:
r-convex functions. 309-323 - James P. Evans, Floyd J. Gould:
On using equality-constraint algorithms for inequality constrained problems. 324-329 - Egon Balas:
Integer programming and convex analysis: Intersection cuts from outer polars. 330-382 - L. C. W. Dixon:
Quasi-newton algorithms generate identical points. 383-387
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.