PTTIC PMA
MATHEMATICAL PROGRAMMING SOCIETY NEWSLETTER
April 1983
Number 9
Council Discusses Recent Issues
The only occasions on w
geographically dispersed officers
Society can all get together are the
tional Symposia. Since at that til
elected officers replace their prei
both groups meet together, and, tr
ly, jointly decide whatever issues ar
The notes that follow, briefly
some of the main issues before th
of the Society, are largely drawn
Minutes of the Council Meetings he
occasion of the XI International Sy
at Bonn, FRG, August 2327, 198
little updating.
Meetings were held on Sunda
22, and then Wednesday and Thu
the Senate Room of the University
chaired by Jean Abadie. Th
meetings totalled some twelve hom
ving about twenty people; the
new officers (listed in the artic
Symposium Highlights" in the prev
of OPTIMA, No. 8), Committee
and various guests who were invite
asked to be heard on some spec
Finances and Membership
Al Williams, as Chairman
Executive Committee and income
surer, reported our finances in go
The Society treasury stands
$45,000. For 1982, income
$53,000 is expected: $19,000 fr
bership dues, $27,500 from Nort
Publishing Company as royalties a
rial payments, and $6,500 from in
miscellaneous sources. Anticipated
total $58,000: $8,500 for the Se
I. Itillfll for publishing activities, ai
for payment of royalties and misc
activities. The excess of expendi
income is not likely to recur; in pla
1982, the Council anticipated
income of $5,000 from the Bon
slum, but in fact no such surplus d
which the The Council felt that the best use of
of the the Treasury's holdings would be in reducing
c Interna the dues of members. Accordingly, it set the
me newly dues for 1983 at $35 U.S., a reduction from
decessors, $40 for 1982. To protect against currency
aditional fluctuations, the exchange rates in effect
e at large. in August 1982 were used to fix the dues in
describing other currencies at: 95 guilders, 72 swiss
e Council francs, 230 french francs, 85 deutschmark,
from the and 20 pounds sterling.
ld on the Our contract with NorthHolland has
mposium been revised on favorable terms. Previously,
2, with a we received from them a substantial editorial
fee, and bought subscriptions to the journal
y, August from them. While the net income to the
irsday, in Society was positive, the expense to the
of Bonn, Society of adding a member (journal subscri
e formal ption plus Secretariat fee) was greater
urs, invol than the membership dues in recent years.
old and The new contract provides for no editorial
le "Bonn payments, but provides 500 free subscrip
ious issue tions in return for our editorial services, with
chairmen, additional subscriptions available at a small
d or who charge. Since it is now profitable for the
ific issue. Society to have new members, the Member
ship Committee will use a long list of non
members it has compiled in a new member
ship drive.
of the There are presently about 16 Student
ing Trea Members of the Society, whose membership
od shape, fee is onehalf the regular fee. There was
at about some discussion of other classes of reduced
of about price membership, such as for retired
om mem people, or spouses of members, and the
hHolland matter was referred to the Membership
nd edito Committee.
terest and
expenses Secretariat
secretariat,
id $3,500
ellaneous
ture over
inning for
further
n Sympo
[eveloped.
Richard Latter, of the International
i'a. il;', Institute, which acts as the
Society's Secretariat, came to Bonn for a
discussion of the services they provide. The
Society would like to change the basis on
which the ISI charges from the present
uniform charge per member to a fixed
charge plus (smaller) ir.,'.i, I charge per
member; the matter is still being discussed.
Publications
In 1982 there was sufficient material
already accepted for publication in Mathe
matical Programming to warrant printing
three volumes (at no extra cost to the
Society.) EditorinChief Cottle sees enough
material coming in to justify three volumes
per year for several years. Commenting that
a Mathematical Programming Study took a
good deal of energy to edit effectively,
Cottle said that he had been discussing with
NorthHolland the possibility of relaxing the
present 180 page requirement for a Study to
allow for considerably larger or smaller
volumes.
Editors Hearn and Bachem were
complimented for work on this Newsletter.
The Council authorized payment of up to
$100 to the author of a feature article in the
Newsletter (provided it was not written by
a Society officer as an official duty).
Committee on Algorithms
Owing to the change of editorship of
the COAL Newsletter, its printing cost will
now be a charge to the Society. The Council
authorized, for the time being, a budget of
no more than $1,500 per year for support of
the COAL Newsletter. Other possibilities,
such as including it in OPTIMA for members
of the Society and requiring a small charge
for others, are under consideration.
There was considerable discussion in
Bonn, pro and con, of a proposal to establish
a COAL Prize for "excellence in experi
mental computation". The Committee
presently has a small fund that could be
used; future funding would be a responsi
bility of the Society. The Council did not
come to a conclusion about that, and is
(Continued next page)
COUNCIL, continued
awaiting further input from the Committee
and the membership.
The Council enthusiastically supported
the Committee's plans to hold a COAL,
conference in Europe adjacent in time to the
I'": I TIMS meeting.
Committee on Stochastic Programming
The Council authorized the formation
of a Committee on Stochastic Programming,
subject to the future recommendations on
*.iidIik.ir. for such committee it intends to
formulate. Andras Prekopa, who proposed
the Committee, was designated its Chairman,
and hopes to have several meeting in Europe
in the near future.
'j. 11 .. Chapter of the Society
The Council pondered the question of
the formation of an Italian Mathematical
'..,.. ,ii....i Society as a chapter of the
Society. As proposed by Franco Ciannessi,
the chapter could bring together Italian
workers in many areas who have a common
interest in optimization which is not well
served by any of the existing professional
groups. Its main activity would be holding
national meetings and stimulating work
shops; it would not undertake publishing
activities. Ile believed that making member
ship in the MPS a condition for membership
in such a chapter would be a tolerable
condition.
The Council did not immediately act
on this proposal, but discussed some of its
implications, and asked Giannessi, Prekopa,
and \i 11i.,,i to recommend guidelines for
the formation of national chapters and for
setting up special interest committees like
that on stochastic programming.
Twelfth Symposium Site
By the time of the Council meeting in
August, several organizations in North
America had expressed an interest in acting
as host for the Twelfth International Sym
posium in 1985. JeanLouis Goffin, as
Chairman of the Symposium Advisory
Committee, agreed to contact these and a
considerable further list of possible hosts.
As of the time of writing, the Council
has received a number of definite proposals,
and the Chairman and Vicechairman have
recommended approval of a specific site to
the Council. The final decision should be
made in a month or so, and will be an
nounced in the next issue of OPTIMA.
Philip Wolfe
CONFERENCE NOTES
FIFTH SYMPOSIUM ON
MATIIHEMATICAL PROGR 111i\II',
WITH DATA PERTURBATIONS
Washington, D.C.
May 1618, 1983
The Fifth Symposium on Mathe
matical Programming with Data Perturba
tions will be held at The George V\' ,,; i...
University's Marvin Center on 1618 May
!":: II symposium is designed to bring
together practitioners, who use mathe
matical ]....IIIIII.ii optimization models
and deal with questions of sensitivity analy
sis, with researchers who are developing
techniques applicable t to these problems.
Papers in mathematical ..... '. ; in .
will he given in the following areas: 1)
Sensitivity and Stability Analysis IResults
and Their Applications. 2) Solution Methods
for Problems Involving Implicitly Defined
Problem Functions. 3) Solution Methods
for Problems Involving Deterministic or
'I... I.i, Parameter Changes. 4) Solution
Approximation Techniques and Error Analy
sis.
Tony Fiacco
SIAM
Symposium on the Applications of
Discrete Mathematics
June 2729, 1983
Registration information will soon be
available for the Symposium on the Applica
tions of Discrete Mathematics, which will be
held June 2729, 1983, at the Massachusetts
Institute of Technology in Cambridge,
Massachusetts. The Symposium is sponsored
by the Society for Industrial and Applied
Mathematics (SIAM).
The symposium is a followup to a
highly successful symposium held by SIAM
in June 1981 at Rensselaer Polytechnic
Institute.
Objectives of the symposium are to
critically examine recent applications of
discrete mathematics, to review recent
developments in discrete mathematics that
have potential applications, and to identify
problems that have to be solved to enhance
the application of discrete techniques. The
symposium will bring together researchers in
the various fields of discrete mathematics
with users of discrete mathematics in indus
try and government. Symposium speak
ers have been invited from academe, in
dustry, and government.
The conference organizing committee
consists of Ronald 1,. Graham, Bell Labora
tories, Peter L. Hammer, University of
'. I. I ..r.. Daniel J. Kleitman, Massachusetts
Institute of T i. h.I...1 and Fred S.
Roberts (chairman), Rutgers UJniversity.
Registration materials may be ob
tained by contacting lHugh B. Hair, SIAM
Services Manager, 1 IiI. Architects rP.;I; ..
117 South 17th I;.. I, Philadelphia, PA
19103, telephone (215) 5642929.
I :!t , OF O F! ,' i r:.
Friends of Optimization met four
times in Fall, 1982. The speakers were
1obby Schnabel (Colorado), "Tensor Models
for Nonlinear Equations;" John Dennis
(Rice), "Iterative Methods for Zeros of
Inaccurately Computed Functions;" Harlan
Crowder (IBM), Ellis Johnson a.rl:\I, and
Manfred Padburg (NYU), "PIPEX: A Pure
ZeroOne Integer Programming Solver;" and
Paul Zipkin (Columbia), "\.:_.. ,ili.. in
Optimization Problems."
The schedule of talks for this spring is
S. below.
Friday, February 11, 1983 10:30 am
Michael Overton (Courant Institute, NYU)
N..11 ii..1. i Optimization"
Friday, March 11, 1983 10:30 am
Richard Van Slyke
(Stevens Institute of Technology)
"On MultiCovering Problems"
Friday, April 8, 1983 10:30 am
Zvi Galil (Columbia University)
"An Efficient Algorithm for Finding Maxi
mal Matchings in Graphs"
Friday, May 6, 1983 10:30 am
Monique Guignard (Wharton School,
University of Pennsylvania) and Kurt
Speilberg (Decision Science Support
Center, IBM)
"Location Problems and Networks with
Fixed Costs"
All of the FOP meetings this Spring
will be held in Room 520 in the S.W. Mudd
Engineering Building at Columbia Univer
sity. The Mudd Building is located on
the southwest corner of 120th Street and
Amsterdam Avenue. It is a short walk across
the Columbia Campus from the 116th Street
stop on the Broadway IRT subway. For
those coming by car, oncampus parking can
be arranged if you call Barbara Korngold,
the administrative assistant for the Industrial
Fni.. rin and Operations Research De
partment at 2802941 at least two working
days before the meetings.
MPS members visiting the New York
area are welcome.
Donald Goldfarb
Department of I.E. and O.R.
Columbia University
New York, New York 10027
Telephone 2808011
IFORS '84
The tenth IFORS (International
Federation of O.R. Societies) conference
will be held in Washington, D.C., August
610, 1984.
The theme of this conference is 
"Cooperation The Culture for O.R.
Success". Three groups of sessions are
being organized: Mainstream (dealing
with the theme), Applications, and
Techniques. These will comprise contri
buted and invited papers. Abstracts
of contributed papers should be less than
100 words (with 5 key words) and
sent to the Program Chairman before
October 15, 1983.
Other features of the conference
will be special Workshops, a Software
and Book Exhibition, and a Microcom
puter Software Fair. For any questions
or suggestions, please contact the Pro
gram Chairman or the Conference Chair
man.
Contacts:
Program Chairman:
Mr. P. N. Belshaw
Canadian National Railways
O.R. & I.E.
P. O. Box 8100
Montreal, Que.
H3B 2M9
Canada
Conference Chairman:
Professor R. M. Soland
Department of Operations Research
School of Engineering and Applied Science
George Washington University
\\ .I.Ir ..I D.C. 20052
USA
Technical Reports & Working Papers
STICHTING MATIIEMATISCH CENTRUM
Kruislaan 413 1098 SJ Amsterdam
Postbus 4079 1009 AB Amsterdam
J.K. Lenstra and A.H.G. Rinnooy Kan, "Theorie de la Complexite
de Calcul Appliquee aux Problems de Couplage, Recouvrement ct Parti
tionnement," BW 125 Price f 3.15.
J.K. Lenstra and A.11.G. Rinnooy Kan, "Introduction a I' Ordon
nacement de Plucieurs Machines," BW 126 Price f 3.15.
K.R. Baker, E.L. Lawler, J.K. Lenstra and A.1H.G. Rinnooy Kan,
"Preemptive Scheduling. of A m..I. Machine to Minimize Maximum Cost
Subject to Release Dates and Precedence Constraints," BW 128 Price f
3.15.
H. Nijmeijer, "Controlled Invariant Distributions for Affine Systems
on Manifolds," BW 130 Price f 3.15.
K. Nafajima, S.L. Hakimi and J.K. Lenstra, "Complexity Results for
Scheduling Tasks in Fixed Intervals on Two Types of Machines," BW 131
Price f 3.15.
H. Nijmeijer, "Controlled Invariance for Affine Control Systems,"
BW 133 Price f3.15.
A.K. Lenstra, J.K. Lenstra, A.II.G. Rinnooy Kan and T.J. Wans
beek, "Two Lines Least Squares," BW 134 Price f 3.15.
H.C. Thijms and M.H. van IHoorn, "Computational Methods for
SingleServer and MultiServer Queues with Markovian Input and General
Service Times," BW 135 Price f 3.15.
H. Nijmeijer and H. A. van der Schaft, "Controlled Invariance for
Nonlinear Systems," BW 136 Price f 3.15.
BJ. Lageweg, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan,
"Computer Aided Complexity Classification of Combinatorial Problems,"
BW 137 Price f 3.15.
R.W. Brockett, "Nonlinear Systems and Nonlinear Estimation
Theory, BW 139 Price f 3.15.
H. Nijmeijer, "Controllability Distributions for Nonlinear Control
Systems," BW 140 Price f 3.15.
J.H. van Schuppen, "The Probabilistic Realization Problem for
Finite Dimensional Gaussian Random Variables," BW 141 Price f 3.15.
M.A.H. Dempster, M.L. Fisher, L. Jansen, BJ. Lageweg, J.K.
Lenstra and A.H.G. Rinnooy Kan, "Analysis of Heuristics for Stochastic
Programming: Results for Hierarchical Scheduling Problems," BW 142
Price f 3.15.
A.M.A. Hariri and C.N. Potts, "An Algorithm for Single Machine
Sequencing with Release Dates to Minimise Total Weighted Completion
Time, BW 143 Price f 3.15.
International Institute for Applied Systems Analysis
System and Decision Sciences Area
2361 Laxenburg, Austria
H. Attouch, R. J.B. Wets, "A Convergence of Bivariate Functions
aimed at the Convergence .. ',jl I. ..Functions," CP82065.
J. P. Aubin, "Lipschitz Behavior of Solutions to Convex Minimiza
tion Problems, "WP81076.
J. P. Aubin, A. Cellina, "'I'll. n.l i Inclusions and Viability
Theory," WP82051.
J. P. Aubin, "Fuzzy Games: The Static and Dynamical Points of
View," CP82031.
J. P. Aubin, "Minimax Theory: A Summary," WP82061.
G. B. Dantzig, M. A. H. Dempster, M. J. Kallio, "LargeScale Linear
Progmmming," CP81SO1.
M. A. H. Dempster, "The Expected Value of Perfect Information in
the Optimal Evolution of Stochastic Systems," WP81055.
Y. M. Ermoliev, "Stochastic Quasigradient Methods and Their
Application in Systems Optimization," WP81002.
Y. M. Ermoliev, G. Leonardi, J. Vira, "The Stochastic Quasi
Gradient Method Applied to a Facility Location Problem," WP81014.
Y. M. Ermoliev, A. A. Gaivoronski, "Simultaneous Nonstationary
Optimization, Estimation and Approximation Procedures," CP82016.
Y M. Ermoliev, C. Nedeva, "Stochastic Optimization Problems with
Partially Known Distribution Functions, "CP82060.
M. Grauer, J. L. Brillet, "About the Portability of the DIDASS
Package (an IBM Implementation)," CP82004.
K. Kiwiel, "A Globally Convergent Quadratic Approximation for
Inequality Constrained Minimax Problems," CP81009.
K. Kiwiel, "A Variable Metric Method of Centers for Nonsmooth
Minimization, CP81023.
A. Lewandowski, M. Grauer, "The Reference Point Optimization
Approach Methods of Efficient Implementation, "WP82026.
A. Lewandowski, "A Program Package for Linear Multiple Criteria
Reference Point Optimization," WP82080.
M. Makowski, J. Sosnowski, "Implementation of an Algorithm for
Scaling Matrices and Other Programs Useful in Linear Programming,"
CP81037.
L. Nazareth, "Analogues of Dixon's and Powell's Theorems for
Unconstrained Minimization with Inexact Line Searches," WP82100.
L. Nazareth, "Implementation Aids for Optimization Algorithms
that Solve Sequences of Linear Programs by the Revised Simplex Method,"
WP82107.
(continued next page)
Technical '". ..'ts ",'.i '',Au; .. continued
E. A. Nrininki, "On a Decomposition of Structured Problems,"
',V P8103 i.
E. A. Nurminski, "Decomposition of TwoBlock Optimization
Problems," WP81073.
E. A. Nurminski, "Convergence and Numerical Experiments with a
Decomposition Algorithm," WP82008.
E. A. Nurminski, "Bibliography on Nondifferentiable Optimiza
tion, WP82032.
E. A. Nurminski, "Decomposition Algorithm Based on the Primal
Dual Approximation," WP82046.
E. A. Nurminski, "Subtraction of Convex Sets and Its Application
in e5, .., r, r. ,,, Calculus," WP82083.
E. A. Nurminski, T. Balabanov, "Decomposition of a LargeScale
energyy Model," WP82095.
E. A. Nurminski, "Progress in ...,,.iit. r' ',,i.I. Optimization,"
CP82S08.
R. T. Rockafellar, "Favorable Classes of Lipschitz continuouss
Functions in Subgradient Optimization," WP81001.
It. T. Rockafcllar, "Augmented Lagrangians and Marginal Values in
Parameterized Optimization Problems, WP81019
R. T. Rockafellar, R. J. B. Wets, "Deterministic and Stochastic
Optimization Problems of Bolza Type in Discrete Time," WP81069.
R. T. Rockafellar, R. J. B. Wets, "On the Interchange of ,..., i .
intiation and Conditional Expectation of Convex Functionals,"
WP81089.
R. J. B. Wets, "A Formula for the Level Sets of epiLimits and
some Applications," WP82081.
R. J. B. Wets, "Stochastic Programming: Solution Techniques and
Approximation Schedules," WP82084.
R. J. B. Wets. "On the Continuity of the Value ofa Linear Pro
rram," WP82106.
A. P. Wierzbicki, "Note on the Equivalence of KuhnTucler Com
plementarity Conditions to an Equation," WP81127.
UNIVERSITY OF BONN
Department of Operations Research
Nassestr. 2
D5300 Bonn 1, West Germany
M. Groetschel and M.W. Padberg, "Polyhedral Aspects of the
Travelling Salesman, Problem II; Computation, "WP 82214OR.
M. Groetschel, M. Juenger, and G. Reinelt, "On the Acyclic Sub
graph Polytope," WP 822150R.
A. Frank, "Disjoint Paths in a Rectilinear Grid," WP 82216OR.
M. Groctscliel, M. Juenger, and G. Reinelt, "Facets of the Linear
Ordering Polytope, WP 82217OR.
J. Araoz, J. Edmonds, and V. Griffin, "Lifting the Facets of Poly
hedra, "WP 82218OR.
M. Groetschel, M. Juenger, and G. Reinelt, "A Cutting Plane Algori
thm for the Linear Ordering Problem, WP 82219OR.
J. Araoz, "Packing Problems in SemiGroup Programming," WP
82220OR.
U. Derigs, and R. Schrader, "Some Greedy Ideas for the Cardinality
,i. i,,,. Problem,"WP 82221OR.
U. Derigs, "Shortest Augmenting Paths and Sensitivity Analysis for
Optimal Matchings," WP 82222OR.
M.D. Plummer and W.R. Pulleyblank, "EquiMatchable Graphs,"
WP 82223OR.
W.H. Cunningham and A. Frank, "A PrimalDual Algorithm for
Submodular Flows, WP 82224OR.
G. Morton, K. Ringwald, and R. von Randow, "A Simple Algorithm
for a Class of Quadratic Smoothing Problems," WP 82225OR.
M.O. Ball and U. Derigs, "An Analysis of Alternate Strategies for
Implementing Matching Algorithms," WP 82226OR.
A. Bachem, "Convexity and Optimization in Discrete Structures,"
WP 82227OR.
M. Groetschel, M. Juenger and G. Reinelt, "Optimal Triangulation
of Large RealWVorld InputOutput Matrices, "WP 82228OR.
J. Araoz and E.L. Johnson, "Polyhedra of Multivalued Additive
System Problems, "WP 82229OR.
H. Korte and L. Lovasz, "Greedoids a Structural Framework for
the Greedy il...,il .n,,"WP 8223001R.
J. Araoz and E.L. Johnson, l"t!.,.r and Liftings for Group and
SemiGroup Problems," WP 82233OR.
U. Derigs, "Optimale Zuordungen und ,'mtchiiins: Anwendungen,
Grundlagen und Verfahren, "WP 82232OR.
J. Araoz and J. Edmonds, "A Case of NonConvergent Pivoting in
Assignment Problems," WP 82233OR.
S. Fujishige, it,. r of Submodular Programs: A FenchelType
MinMax Theorem and Subgradients of Submodular Functions," WP
82234OR.
U. Faigle, G. Richter, and M. Stern, "Geometric Exchange Proper
ties in Lattices of Finite Length,"WP 82235OR.
S. ,i.ili,_.. "Structures of Polyhedra Determined by Submodular
Functions of Crossing Families, WP 82236OR.
M. Juenger and G. Reinelt, "Techniques and Machines in the His
tory of Computing," WP 822370R.
J. Araoz, W.H. Cunningham, J. Edmonds and J. GreenKrotky,
"Reduction to 1Matching Polyhedra," WP 822380 R.
F. Barahona, "The MaxCut Problem on Graphs not Contractible to
K(5)," WP 82239OR.
J. Araoz, "Subadditive Characterization of Ordered ,, ...
Problems," WP 82240OR.
S. Fujishige, "Characterization of ., i.i, l r ,r,.,t of Submodular
Functions and its Relation to Lovasz's Extension of Submodular Func
tions," WP 82241OR.
B. Korte and L. Lovasz, "Structural Properties of Greedoids,"
WP 82242OR.
A.A.F. Oliveira and C.C. Gonzaga, "Convergence Bounds for the
'Capacity' MaxFlow Algorithm," WP 82243OR.
I. Korte and L. Lovasz,"A Note on Selectors and Greedoids,"WP
82244OR.
U. Derigs and B. Korte, "Discrete and Cormbinatorial Optimization:
General Introduction," WP 82245OR.
U. Derigs and B. Korte, "Independence Systems and Combinatorial
Optimization," WP 82246OR.
U.Derigs and B. Korte, "Polyhedral Combinatorics and Cutting
Plane Methods, WP 82247OR.
U. Derigs and B. Korte, "The Branch and Bound Approach to
Combinatorial Optimization Problems, WP 82248OR.
U. Derigs and B. Korte, "Approximative Methods for Combinatorial
Optimization Problems," WP 822490 R.
R.E. Bixby, W.H. Cunningham and D.M. Topkis, "The Partial Order
of a Polymatroid Extreme Point," WP 82250OR.
M. Juenger, W.R. Pulleyblank and G. Reinelt, "On Partitioning the
Edges of Graphs into Connected Subgraphs," WP 822510R.
A. Frank and E. Tardos, "An Algorithm for the Unbounded Matroid
Intersection Polyhedron," WP 82252OR.
G. Gastou and E.L. Johnson, "Binary Group and Chinese Postman
Polyhedra, WP 822530 R.
A. Frank, "Submodular Flows, WP 82254OR.
University of North Carolina at Chapel Hill
Curriculum in Operations Research and Systems Analysis
Chapel Hill, NC 27514
Paul T. Boggs and Jon W. Tolle, "Merit Function for Nonlinear
Programming Problems," 812.
Paul T. Boggs and Jon W. Tolle, "An Implementation of a Quasi
Newton Method for Constrained Optimization," 813.
UNIVERSITY OF COLOGNE
Department of Mathematics
D5000 Cologne, West Germany
R. Euler, "Perfect Independence Systems," 8119.
U. Zimmerman, "Minimization of Combined Objective on Integral
Submodular Flows," 82/02.
U. Zimmerman, "Augmenting Circuit Methods for Submodular
Flow Problems," 82/03.
R. Euler, "Odd Cycles and a Class of Facets of Independence
System Polyhedra," 82/06.
Tilburg University
Department of Econometrics
P. O. Box 90153
5000 LE Tilburg
THE NETHERLANDS
A. J. de Zeeuw, "Hierarchical Decentralized Optimal Control in
Econometric Policy Models, RM 107.
A. Kapteyn and T. J. Wansbeek, "Identification in Factor Analysis,"
RM 108.
G. van der Laan and A. J. J. Talman, "Simplicial Algorithms for
i,.li.' Stationary Points, a Unifying Approach," RM 109.
B. B. van der Genugten, "The Asymptotic Behaviour of the Esti
mated Generalized Least Squares Method in the Linear Regression Model."
RM 111.
H. H. Tigelaar, "The Informative Sample Size for Dynamic Multiple
Equation Systems with Moving Average Errors," RM 113.
A. J. de Zeeuw, "Policy Solutions for MiniInterplay, a Linked
Model for Two Common Market Countries," RM 116.
F. J. M. van Doome and P. H1. M. Ruys, "Die Struktur einer Sprech
handlung in Habermas' Forschungsprogram: Formale Analyse mit den
Mittcln des tripolaren Modells," RM 11 7.
G. van der Laan and A. J J. Talman, "Simplicial Approximation of
Solutions to the NonLinear Complementarity Problem," RM 118.
P. G. H. Mulder and A. L. Hempenius, "I ......... Life Time in a
Competing Risks Model for a Chronic Disease," RM 21.
G. van der Laan and A. J J. Talman, "From Fixed Point to Equili
brium," RM 122.
Georgia Institute of Technology
School of Industrial and Systems Engineering (ISyE)
College of Management (COM)
School of Mathematics (Math)
Atlanta, GA 30332
F. AlKhayyal, "Jointly Constrained Bilinear Programming and
Related Problems," ISyE.
,. J. Bartholdi, Ill, "On the I'mlt.. iti of Finding Nice Subma
trices," ISyE, 8208 PRDC.
C. E. Blair and R. G. Jeroslow, "Computational Complexity of
Some Problems in Parametric Discrete Programming," COM.
J. J. Bartholdi, III, and L. K, Platzman, "An O(NlogN) Planar
Travelling Salesman Heuristic Based on 1.... lirli. Curves," ISyE, 8207,
PRDC.
F. Cullen, J. J. Jarvis, and Hi. D. Ratliff, "IRG Interactive Route
Generator: A Narrative Description," ISyE, 8215, PRDC.
R. G. Jeroslow and D. F. Karney, "Cluster Sets of Vector Series,"
COM, MS826.
D. F. Karney, "A Duality Theorem for SemiInfinite Convex Pro
grams and Their Finite Subprograms," COM, MS824.
D. F. Karney, "The Number of Constraints in a SemiInfinite
Program is Always Countable," COM, MS825.
D. F. Karney and T. D. Morley, "Limiting Lagrangians a Primal
Approach," COM and Math, MS823.
L. F. McGinnis, "Computer Aided Layout Programs: A Contem
porary Appraisal," ISyE, 8211, PRDC.
L.F. McGinnis and Rao, "Optimal Lot Sizing in Acyclic Multiperiod
Production Systems," ISyE, 8210, PRDC.
L. F. McGinnis, R. J. Graves and Joneja, "Multicriterion Layout
Evaluation: The Value Measurement Problem," ISyE, 8212, PRDC.
L. F. McGinnis, and Runyan, "A Computer Package for the Com
posite Criterion Model," ISyE, 8213, PRDC.
B. Montrieul, H. D. Ratliff and M. Goetschalckx, "Matching Based
Interactive Facility Layout," ISyE, 8202, PRDC.
M. Pinedo, "Applications of Duality and Stochastic Dominance in
Reliability Theory," ISyE, 8201, PRDC.
M. Pinedo, "On Flow Time and Due Dates in Stochastic Open
S,,..."ISyE, 8205, PRDC.
M. Pinedo, "Stochastic Shop Models with Jobs that Have Dependent
Processing Times at the Various Machines," ISyE, 8209, PRDC.
H. D. Ratliff and T. Tran, "Optimum Four Module Pallet Packing,"
r8203, PRDC.
J. Spingarn, "Partial Inverse of a Monotone Operator," Math.
C. A. Tovey, "Low Order Polynomial Bounds on the Expected
Number of Iterations of Local Improvement Algorithms," I .i RR No.
J826.
C. A. Tovey, "Hill Climbing with Multiple Local Optima," ISyE, RR
No. J827.
C. A. Tovey, "Sensitivity of P I] Cmax with Respect to the Number
of Processors," ISyE, RR No. J828.
Systems Optimization Laboratory
Department of Operations Research
Stanford University
Stanford, CA 94305
Curtis Eaves and James A. Yorke, "Equivalence of Surface Density
and Average Directional Density," SOL 821.
B. AviItzhak, T. J. Connolly, G. B. Dantzig, P. H. McAllister and W.
D. Winkler, "A Dynamic Equilibrium Model for EnergyEconomic Plan
ning, SOL 822.
B. Aviltzhak, T. J. Connolly, G. B. Dantzig, P. H. McAllister and W.
D. Winkler, "Mathematical Appendix: A Dynamic Equilibrium Model for
EnergyEconomic Planning," SOL 823.
Klaus Schittkowski, "On the Convergence of a Sequential Quadratic
Programming Method with an Augmented Lagrangian Line Search Func
tion," SOL 824.
B. Curtis Eaves, "Permutation Congruent Transformations of the
Freudenthal Triangulation with Minimal Surface Density," SOL, 825.
Philip E. Gill, Walter Murray, Michael A. Saunders, and Margaret H.
Wright, "Procedures for Optimization Problems with a Mixture of Bounds
and General Linear Constraints," SOL 826.
Philip E. Gill, Walter Murray, Michael A. Saunders and Margaret H.
Wright, "User's Guide for SOLIQPSOL: A FORTRAN Package for Quad
ratic Programming," SOL 827.
Mukund N. Thapa, "Optimization of Unconstrained Functions with
Sparse Hessian MatricesNewtonType Methods," SOL 828.
Patrick H. McAllister, "1982 EPRI Overview Planning Scenario
Results from the Pilot Process Integrated Model," SOL 829.
Richard W. Cottle and Steven G. Duvall, "A Lagrangean Relaxation
Algorithm for the Constrained Matrix Problem," SOL 8210.
George B. Dantzig, "Mathematical Programming and Decision
Making in a Technological Society," SOL 8211.
Frederick S. Hillier, "Heuristics: A Gambler's Roll," SOL 8212.
Alan J. Hoffman and S. Thomas McCormick, "A Fast Algorithm
That Makes Matrices Optimally Sparse," SOL 8213.
UNIVERSITY OF MARYLAND
College of Business and Management
College Park, Maryland 20742
Assad, Golden, "A Preliminary Framework for Urban Model
Building," 82035.
Wolkowicz, "Generating Eigenvalue Bounds Using Optimization,"
82037.
Gass, "On the Solution of LinearProgramming Problems with Free
(Unrestricted) Variables," 82038.
Gass, Shao, "On the Solution of Special Generalized Upper
Bounded Problems: The LP/GUB Knapsnack Problem and the X Form
Separable Convex Objective Function Problem," 82040.
Golden, Gheysens, Baker, "Network Optimization Heuristics: A
Brief Overview," 82041.
Skiscim, "Description of a Large Scale Network Simulation for
Digital Radio Networks," 82042.
Assad, Golden, "Statistics in Optimization," 83004.
Gheysens, Golden, Assad, "A Comparison of Techniques for Solving
the Fleet Size and Mix Vehicle Routing Problem," 83005.
Trader, "A Bayesian Predictive Approach to the Selection of
Variables in Multiple Regression," 83006.
BOOK REVIEWS
Integer Programming and Related Areas
A Classified Bibliography 19781981
edited by Rabe von Randow
Lecture Notes in Economics and Mathematical Systems, Vol. 197
Springer Verlag
Berlin, Heidelberg, New York, 1982
For the third time the Bonn Institute of Operations Research has
undertaken the respectable effort to compile and publish its classified
bibliography of integer programming and related areas After the first
volume covering the period until 1975 and the second for the period
19761978 (Volumes 128 and 160 in the Lecture Notes in Economics and
Mathematical Systems), this one continues this important work for the
period 19781981.
The third volume, edited by Rabe von Randow, maintains the
traditional form of a comprehensive survey of all accessible publications
scattered over many journals, proceedings volumes, monographs and
working papers.
Part 1 contains the alphabetical bibliography which lists all publica
tions alphabetically by the first author and chronologically for each
author, and includes the full bibliographical data plus a reference code
which reflects the author's name and the year of publication. The purpose
of the code is to enable the user to identify publications referenced in Part
2 and Part 3. In Part 2 the publications have been classified according to
51 subjects: within each subject the ordering is again alphabetical by the
first author. Those 51 subjects cover the topics Theory and Methods of
General Integer Programming, Combinatorial and Graph Theoretical
Optimization Problems Related to Integer Programming, Applications of
Integer Programming. The purpose of Part 3 is to enable the user to locate
publications for which only a coauthor's name is known. It consists of an
alphabetical catalogue of all the authors appearing in Part 1 and lists for
each author the reference codes of all his publications.
This biblography is so well known and generally appreciated by
scientists working in the field of integer programming or in related areas
that we can confine ourselves to merely announcing the long expected
third volume.
M. Jiinger, Cologne
Optimization Over Time, Vol. 1
by Peter Whittle
John Wiley, New York, 1982
This book provides a systematic and unified treatment of control
problems where emphasis is placed on discretetime, finitehorizon pro
blems. Both deterministic and stochastic models, respective models
with complete and incomplete information, are dealt with. It is demon
strated that the dynamic programming methods provide an intuitive
and farreaching tool which applies to a wide range of important problems
Starting from a wellchosen classification of the problems, the author
elaborates the essential principles and basic structures of the theory and
carefully reveals the interrelationships and analogies between different
areas (continuous time discrete time, minimax stochastic approach,
deterministic stochastic approach). The material is presented at such a
level that the reader can appreciate its basic characteristics and distinctions.
At the same time, the author succeeds in evading technicalities which
would only conceal the intrinsic nature of the problems In particular, the
book is not concerned with questions of technical measurability where in
the author's judgement the natural view of these matters has yet to be
found. The organization of the book enables the author to treat many of
the classical, as well as many modern, challenging examples in an adequate
manner.
In general the book deals with the discrete time case, passing to the
continuous time case only when it is more natural or more convenient for
the respective problem. The theory profits from the discrete time formula
tion by the direct and explicit way of obtaining recursive relations. How
ever, the maximum principle is also extensively discussed in continuous
time where it, and its relation to the dynamic programming principle, are
more natural.
Books for review should be sent to the Book Review Editor, Prof. Dr.
Achim Bachem, Institut fir Operations Research, Nassestrasse 2, D5300
Bonn 1, W. Germany.
The infinite horizon models are treated only in a heuristic manner
postponing the proofs to the projected second volume. The book contains
interesting new material mainly in the areas of multiarmed bandit and
generalized linear/quadratic/Gaussian models.
The text is divided into three parts, Part I: deterministic problems
(including dynamic models), Part II: stochastic formulation (including
Markov decision processes), Part III: linear/quadratic/Gaussian models
(including recursive filtering procedures and risksensitive control). These
parts contain the major areas of discretetime control theory as well
as many important examples such as: consumptioninvestment problems,
production scheduling, the warehousing problem, eikonal problems, the
bush problem, rocket thrust program optimization, control of temperature
peaking, secretary problems, replacement models, gambling (optimality of
bold play), control of queues, inventory and storage problems, index
policies for sequential scheduling (multiarmed bandits). The book addres
ses itself to people in operational research and optimization theory, control
engineers, economists and statisticians, and, since exercises are included, it
could also be used as a text for some advanced courses
M. Schiil, Universitat Bonn
The Theory of Subgradients and its Applications to
Problems of Optimization.Convex and Nonconvex Functions
by R.T. Rockafellar
Heldermann, Berlin, 1981
In broad classes of optimization problems, which range from models
in economics and operations research over approximation problems to
variational principles that correspond to partial differential equations, it is
often necessary to treat functions that are not differentiable in any tradi
tional two sided sense. Therefore, since the early 1960's, much effort
has gone into the development of a generalized kind of differentiation for
extendedrealvalued functions on real vector spaces that can serve in the
analysis of optimization.
This beautiful book, written in Rockafellar's typically lucid style,
gives a very clear, easily understandable and comprehensive treatment of
the development up to the end of the 1970's. It is the original English
version of ten lectures, given by the author at the University of Montreal in
1978 (A French translation by G. Tilquin was published by Les Presses de
I'Universite'de Montreal in 1979).
The treatment is restricted to functions defined on Rn, so as not
to distract attention from the main ideas by technical complications. It
contains important unifying and clarifying aspects that cannot be found in
previous literature and highly benefits from the author's broad and deep
knowledge of the field. The presentation of the results is essentially
selfcontained.
A brief outline of the organization of the book is as follows:
In the introductory chapter the most important cases of nondiffer
entiability in optimization are described: Chebychev approximation,
reduction of the number of constraints, exact penalties, marginal functions
in various contexts, etc.
In Chapter 2, on tangent cones and normal vectors, fundamental
properties of, and relations between, contingent cones (the classical tan
gent cones), tangent cones in the sense of Clarke, hypertangent cones
and normal cones are established.
In Chapter 3, on subderivatives and subgradients, the author extends
his earlier results in convex optimization to the nonconvex case by intro
ducing and investigating concepts like lower semidifferentiability, lower
semigradients, upper subderivatives.
Chapters 46 contain most important results in nonsmooth optimi
zation: Lipschitzian cases, subdifferential calculus, optimality conditions,
duality and marginal functions.
Chapter 7 concludes the book by applying results of the previous
chapters to monotone operators.
The book is highly recommended for anyone interested in modern
analysis and optimization theory.
Reiner Horst
C13L s  
~ Il~~s~_ _s~ ll____s__~____~___E______~
Practical Methods of Optimization, Vol. 2:
Constrained Optimization
by R. Fletcher
John Wiley, New York, 1981
This book is the second part of a twovolume work which considers
practical optimization problems and is addressed to both under and
postgraduate readers. In contrast to part one, constrained optimization is
regarded. The intention of the author throughout this book is to empha
size numerically practicable and reliable methods. In every chapter the
basic structure of the problem is exhibited first and is then amplified
and qualified with rigour.
After introduction in chapter 7 (joining chapter 6 of volume 1)
chapter 8 deals with linear programming problems where, besides the
simplex method, other techniques such as duality, decomposition, para
metric programming and the active set method are considered. After
presenting the theory of constrained optimization (. .i, I Iai liii; I
first and second order condition, convexity, duality), in chapter 10 the
S,.. case of quadratic programming is regarded with stress upon Lagran
gian, active set and complementary pivoting methods. I,,... ..,ii.
general optimization problems with linear I i..il and inequality con
straints are examined and strategies to prevent the special phenomenon of
zig~lagging are given attention.
Chapter 12 deals with nonlinear programming. Approaches by
... i, and barrier functions, SOLVER, elimination, feasible direction and
further methods arc shown. The treatment of other optimization problems
such as integer and geometric programming in a less, and nondifferentiable
optimization in a more, detailed way completes this book. The latter
topic points at the current research of the author and besides optimality
conditions and exact penalty functions, it also contains the study of
.ii ,;[. .... search, bundle, cutting plane, QLmethod).
URNAIS& STUDIES
Volume 25 No. 2
M. Kojima and S. Mizuno, "Computation of all Solutions to a
System of Polynomial Equations".
M. N. Thapa, "Optimization of Unconstrained Functions with
Sparse Hessian MatricesQuasiNewton Methods".
C. McDiarmid, 'in. i d Decomposition in Polyhedra".
J. It. Brown, "The Flow Circulation i ,in, Problem".
R. Hassin, "The Miinimum Cost Flow Problem: A Unifying Ap
proach to Dual Algorithms and a New TreeSearch Algorithm ".
J. Ponstein, "Comments on the General Duality ''11. by J. Tind
and L. A. 11 ., "
Volume 25 No. 3
R. Fourer, .. I iit, Staircase Linear Programs by the Simplex
Method, 2: Pricing".
S. P. Han and 0. L. Mangasarian, "A Dual Differentiable Exact
Penalty Function".
J. J. Strodiot, V. Hien Nguyen and N. Heukemes, "eOptimal
Solutions in Nondifferentiable Convex Programming and Some Related
Questions ".
Y. Yamamoto, "A New Variable Dimension Algorithm for the
Fixed Point Problem'".
J. Jahn, "Duality in Vector Optimization".
G. van der Laan and A. J. J. Talman, "Note on the PathFollowing
Approach of Equilibrium Programming".
M. J. Best and R. J. Caron, "A Method to Increase the Computa
tional Efficiency of Certain Quadratic Programming Algorithms".
E. Kohlberg, "Consistency of Finite Systems of Convex Inequal
ities ".
*Volume 26, No. I
M. J. Todd, "i a ... il Linear Programming: Geometry, Working
Bases and Factorizations".
R. R. Meyer, "Computational Aspects of TwoSegment Separable
Programming".
S. Dafermos, "An Iterative Scheme for Variational Inequalities".
R. K. Martin and D. J. Sweeney, "An Ideal Algorithm for Integer
Programs with Special Ordered Sets of Variables".
P. J. Carstensen, "Complexity of Some Problems in Parametric and
*Volume 26 contents subject to change by publisher.
Each chapter is concluded with a number of questions, and many
figures illustrate the subject.
B. Giildner, University of Erlangen
Connectivity in Multifactor Designs
by Lothar Butz
Heldermann, Berlin, 1982
The algebraic core of one of the basic problems in the theory of
linear statistical models namely the identifiability problem is to char
acterize the consistency of a matrix equation XB = A. Characterizations in
terms of concepts of linear algebra (rank conditions, ginverses, etc.) are in
practical applications often not very useful because of the large size of the
"design"matrix B. Now for many models, in particular in ANOVA
settings, the designmatrix is an incidence matrix having a certain block
structure. In those cases combinatorial characterizations seem to be
possible. In fact, in 1947 R. C. Bose remarked that in models with one
treatment and one additive block factor the consistency of XB = A is
equivalent to the connectedness of a certain associated bipartite graph.
The monograph by Butz extends this characterization in all general
ity to , II.I, with n additive block factors. It turns out for a very
special case this has first been seen by Wynn (1977) that in the general
case, directed graphs whose arcs are integer labelled have to be associated
and that, in addition to connectedness, conditions on the number of cycles
are relevant. To check the last condition, an algorithm by reduction is
presented which seems to be interesting by itself.
The book is clearly written; proofs and methods are supplemented
by wellchosen examples. Some background in graph theory is necessary
to understand the proofs.
Although aimed at a rather limited number of readers, tih mono
graph is an i. r. I;,. contribution ii ......:. :ii, the interplay of com
binatorial design, graph theory and "discrete" linear algebra.
0. Krafft, Aachen
Integer Programmring".
M. E. Posner, "The Continuous il.t ... Knapsack Problem".
S. J. Grotzinger, "On ( m.. .. i, in. LSupports, Natural and
Chebyshev Approximates".
G. Huberman, "Error Bounds for the Aggregated Convex i ....
ming Problem".
S. Halfin, "The Sphere Method and the Robustness of the I Ili .i.'
Algorithm".
*Volume 26 No. 2
G. "i i ii. "Maximal Flow Through a Domain".
K. Tone, "Revisions of Constraint Approximations in the Successive
QP Method for Nonlinear Programming".
S. T. McCormick, "Optimal Approximation of Sparse Hessians and
its Equivalence to a Graph Coloring Problem".
W. B. van Dam, J. B. G. Frenk, and J. Telgen, "t:.'.i..,...i Gener
ated Polytopes for Testing Mathematical Programming Algorithms".
W. H. Cunningham and J. G. Klincewicz, "On Cycling in the Net
work Simplex Method".
R. S. Dembo and T. Steihaug, "TruncatedNewton Algorithms for
LargeScale Unconstrained Optimization".
P. Loridan and J. Morgan, "Penalty Functions in Programming
and CMinimax Problems".
S. Komlosi, "Some Properties of Nondifferentiable Pseudoconvex
Functions".
P. Zipkin and K. Raimer, "An Improved Dr'....r...r,,.., Method for
Transportation Problems".
*Volume 26 No. 3
R. T. Rockafellar, "Marginal Values and SecondOrder Necessary
Conditions for Optimality".
G. Cornuejols, D. Naddef and W. R. Pulleyblank, "Halin Graphs and
the Travelling Salesman Problem".
B.h. Ahn, "Iterative Methods for Linear Complementarity Problems
with Upper Bounds on Primary Variables".
J. R. Birge and A. Gana, "Computational Complexity of Van der
Heyden's Variable Dimension Algorithm and DantzigCottle's Principal
Pivoting Method for Solving LCP's".
R. E. Steuer and EU. Choo, "Interactive Weighted Tchebycheff
Procedure for Multiple Objective Programming".
T. Ibaraki, "Parametric Approaches to Fractional Programs".
GALLIMAUFRY
Martin Beale (Scicon) conveys the news that M.J.D. Powel (Cambridge) was elected a
Fellow of the Royal Society on 17 March, 1983. The citation reads: "Distinguished for his
many contributions to numerical analysis, especially for the construction of powerful algori
thms for nonlinear optimization and the theoretical evaluation of their convergence proper
ties."
Visitors at the Institute of Operations Research, University of Bonn during 198283
include L. Bakajew (Kiev), F. Barahona (University of Chile), W.H. Cunningham (Carleton),
S. Fujishige (Sakura, Japan), R.G. Jeroslow (Georgia Tech), and M.M. Syslo (Washington
State)....An announcement from CORE (Louvain), received too late for the last OPTIMA,
stated the availability of 198384 postdoctoral and faculty fellowships. The application
deadline was February 15, 1983. The contact at CORE is Paul Champsaur....E.A. Nurminki
(IIASA) announces the volume Progress in Nondifferentiable Optimization, available from the
IASA publications department for $14....There will be an IFIP conference October 2426,
1983 in Lyon, France on "Optimization in ComputerAided Design," Contact Prof. Jolm S.
Gero, Dept. of Architectural Science, University of Sydney, Sydney N.S.W. 2006, Australia.
Deadline for the next OPTIMA is July 15, 1983.
This public document was promulgated at a cost of $426.15 or
$0.61 per copy to inform researchers in mathematical programming of
recent research results.
OPTIMA
303 Weil Hall
College of Engineering
University of Florida
Gainesville, Florida 32611 FIRST CLASS MAIL
C A L E N D AR
Calendar of mathematical programming meetings
as of 1 April 1983
Maintained by the Mathematical Programming Society (MPS)
This Calendar lists noncommercial meetings specializing in mathematical programming or one of its
subfields in the general area of optimization and applications, whether or not the Society is involved.
(The meetings arc not necessarily 'open'.) Any one knowing of a meeting that should be listed here is
urged to inform Dr. Philip Wolfe, IBM Research 33221, POB 218, Yorktown Heights, NY 10598,
U.S.A; Telephone 9149451642, Telex 137456.
Some of these meetings are sponsored by the Society as part of its worldwide support of activity
in mathematical programming. Under certain guidelines the Society can offer publicity, mailing lists and
labels, and the loan of money to the organizers of a qualified meeting. For further information address
the Treasurer of the Society, Dr. A. C. Williams, Mobil Corporation, 150 East 42d Street, New York,
NY 10017, U.S.A.; Telephone 2128837678.
Substantial portions of meetings of other societies such as SIAM, TIMS, and the many national OR
societies are devoted to mathematical programming, and their schedules should be consulted.
April 510: 15th Conference 'Mathematical Optimization', Sellin/Rtigen, German Democratic Republic.
Contact: Dr. R. Hansel, Sektion Mathematik, HumboldtUniversitit zu Berlin, 1086 Berlin,
German Democratic Republic; telephone 203 2239.
May 1314: 'Optimization Days', Campus de la Universit6 de Montr6al, Canada. Contact: Professor
Michael Polis, Ecole Polytechnique de Montr6al, C.P. 6079, Succ. 'A', Montr6al, Qu6bec,
Canada H3C 3A7; telephone 5143444884, Telex 0524146 BIBPOLYTEC. Sponsored by
ACFAS, CAMS, IEEE, and the MPS.
May 1618: 'Fifth Symposium on Mathematical Programming with Data Perturbations', The George
Washington University, Washington, D.C., U.S.A. Contact: Professor Anthony V. Fiacco,
Department of Operations Research, School of Engineering and Applied Science, The George
Washington University, Washington, D.C. 20052, U.S.A.; telephone 2026767511. Deadline
for abstracts, 1 March 1983.
June 2021: IFAC Workshop on Applications of Nonlinear Programming to Optimization and Control,
San Francisco, California, U.S.A. Abstract deadline February 1, 1983. Contact: Herbert E.
Rauch, Lockheed 5256/205, Palo Alto Research Laboratory, 3251 Hanover Street, Palo
Alto, CA 94304, U.S.A.; Telephone 4154934411, Extension 45677.
June 2729: SIAM S'. mupli'iuti on the Applications of Discrete Mathematics, Cambridge, Massachusetts,
U.S.A. Contact: Hugh B. Hair, SIAM Services Manager, 1405 Architects Building, 117 South
17 Street, Philadelphia, Pennsylvania 19103, U.S.A.; Telephone 2155642929.
July 415: Summer School on Combinatorial Optimisation, Dublin. Contact: Secretariat, Summer
School on Combinatorial Optimisation, National Institute for Higher Education, Glasnevin,
Dublin 9, Ireland.
July 1115: 3d IFAC/IFORS Symposium 'Large Scale Systems: Theory and Applications', Warsaw.
Deadline for abstracts, 15 February 1982. Contact: Dr. Z. Nahorski, 3d IFAC/IFORS
LSSTA, Systems Research Institute, Polish Academy of Sciences, ul. Newelska 6, 01447
Warszawa, Poland; Telex 812397 ibs pl, Telephones 364103, 368150.
July 2529: 11th IFIP Conference on System Modelling and Optimization,'Copenhagen, Denmark.
Deadline for abstracts, 31 December 1982. Contact: Professor P. ThoftChristensen, Institute
of Building Technology and Structural Engineering, Aalborg University Center, P.O. Box 159,
DK9100 Aalborg, Denmark.
