A framework of concepts is developed which helps to unify a substantial portion of the literature on large-scale mathematical programming. These concepts fall into two categories. The first category consists of problem manipulations that can be used to derive what are often referred to as...

Indexing structures are of fundamental importance to modeling languages for mathematical programming as a device for mathematical abstraction, and because they facilitate achieving conciseness, stability, and error-resistance. The aim of this article is to stimulate discussion of such...

The problem manipulations and solution strategies of Part I of this paper are now further illustrated by combining them in various ways to yield several known algorithms. The main object is not an exposition of these algorithms, although this is certainly important; rather, we wish to focus on...

The theory presented in Part I of this paper led to a Basic Parametric Procedure for a broad class of strictly concave parametric programs. In this part, additional theory is developed that facilitates efficient computational implementation. An illustrative graphical example is given, and some...

The focus of this paper is multiperiod production and sales planning when there is a single dominant production operation for which tooling (dies, molds, etc.) can be shared among parts and is limited in availability. Our interest in such problems grew out of management issues confronting an...

This paper, which is presented in two parts, develops a computational approach to strictly concave parametric programs of the form: Maximize \alpha f₁(x) + (1 - \alpha )f₂(x) subject to concave inequality constraints for each fixed value of \alpha in the unit interval, where f₁ and f₂ are...