


default search action
Mathematical Programming, Volume 24
Volume 24, Number 1, 1982
- Gerard Debreu, Tjalling C. Koopmans:

Additively decomposed quasiconvex functions. 1-38 - Jerrold H. May, Robert L. Smith:

Random polytopes: Their definition, generation and aggregate properties. 39-54 - John K. Reid:

A sparsity-exploiting variant of the Bartels - Golub decomposition for linear programming bases. 55-69 - Aharon Ben-Tal, Jochem Zowe:

Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems. 70-91 - Frederic H. Murphy, Hanif D. Sherali, Allen L. Soyster:

A mathematical programming approach for determining oligopolistic market equilibrium. 92-106 - Martin E. Dyer

, John Walker:
Solving the subproblem in the lagrangian dual of separable discrete programs with linear constraints. 107-112 - Thomas F. Coleman, Andrew R. Conn:

Nonlinear programming via an exact penalty function: Asymptotic analysis. 123-136 - Thomas F. Coleman, Andrew R. Conn:

Nonlinear programming via an exact penalty function: Global analysis. 137-161 - L. McLinden:

Polyhedral extensions of some theorems of linear programming. 162-176 - Masakazu Kojima, Yoshitsugu Yamamoto:

Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods. 177-215 - Michael J. Todd:

On the computational complexity of piecewise-linear homotopy algorithms. 216-224 - Jonathan M. Borwein

:
A note on the existence of subgradients. 225-228 - Bahman Kalantari, J. Ben Rosen:

Penalty for zero-one integer equivalent problem. 229-232 - Yair Censor

, Arnold Lent:
Cyclic subgradient projections. 233-235 - Claude Lemaréchal, Robert Mifflin:

Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions. 241-256 - Alfred Auslender:

On the differential properties of the support function of the ∈-subdifferential of a convex function. 257-268 - Reinhardt Euler:

Regular (2, 2)-systems. 269-283 - Jong-Shi Pang, Donald Chan:

Iterative methods for variational and complementarity problems. 284-313 - John R. Birge

:
The value of the stochastic solution in stochastic linear programs with fixed recourse. 314-325 - Jacob Flachs:

Global saddle-point duality for quasi-concave programs, II. 326-345 - Michael G. Sklar, Ronald D. Armstrong:

Least absolute value and chebychev estimation utilizing least squares results. 346-352 - Yuan Y. Sung, J. Ben Rosen:

Global minimum test problem construction. 353-355 - John M. Danskin:

A Lipschitz constant associated with lemke's closest-point principle. 356-358

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














