


default search action
Mathematical Programming, Volume 5
Volume 5, Number 1, December 1973
- Paula M. J. Harris:

Pivot selection methods of the Devex LP code. 1-28 - Václav Chvátal:

Edmonds polytopes and weakly hamiltonian graphs. 29-40 - James W. Daniel:

Stability of the solution of definite quadratic programs. 41-53 - James P. Evans, Ralph E. Steuer:

A revised simplex method for linear multiple objective programs. 54-72 - Gautam Appa, Cyril Smith:

On L1 and Chebyshev estimation. 73-87 - Jack Edmonds, Ellis L. Johnson:

Matching, Euler tours and the Chinese postman. 88-124 - Roger Fletcher:

An exact penalty function for nonlinear programming with inequalities. 129-150 - William W. Hogan:

Applications of a general convergence theory for outer approximation algorithms. 151-168 - James E. Falk:

A linear max - min problem. 169-188 - Christakis Charalambous:

Unconstrained optimization based on homogeneous models. 189-198 - Manfred W. Padberg:

On the facial structure of set packing polyhedra. 199-215 - Norman Zadeh:

More pathological examples for network flow problems. 217-224 - Kenneth J. Arrow, Floyd J. Gould, S. M. Howe:

A general saddle point result for constrained optimization. 225-234 - Stephen M. Robinson:

Computable error bounds for nonlinear programming. 235-242 - Siegfried Schaible:

Quasi-concavity and pseudo-concavity of cubic functions. 243-247 - William F. Lucas:

Book review. 248-249 - Norman Zadeh:

A bad network problem for the simplex method and other minimum cost flow algorithms. 255-266 - Mokhtar S. Bazaraa, Jamie J. Goode:

Extension of optimality conditions via supporting functions. 267-285 - Fredric H. Murphy:

A column generation algorithm for nonlinear programming. 286-298 - C. B. García:

Some classes of matrices in linear complementarity theory. 299-310 - Edward L. Keller:

The general quadratic optimization problem. 311-337 - F. D. J. Dunstan, D. J. A. Welsh:

A greedy algorithm for solving a certain class of linear programmes. 338-353 - R. Tyrrell Rockafellar

:
A dual approach to solving nonlinear programming problems by unconstrained optimization. 354-373 - L. C. Westphal, Allen R. Stubberud:

The associated maximization problem for separable games. 374-380

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














