MATHEMATICAL PROGRAMMING SOCIETY NEWSLETTER
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 23-27, 198
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 North-Holland 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-
of the There are presently about 16 Student
ing Trea- Members of the Society, whose membership
od shape, fee is one-half 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
h-Holland matter was referred to the Membership
nd edito- Committee.
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.
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.) Editor-in-Chief 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
North-Holland the possibility of relaxing the
present 180 page requirement for a Study to
allow for considerably larger or smaller
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)
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
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. Jean-Louis 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 Vice-chairman 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.
FIFTH SYMPOSIUM ON
MATIIHEMATICAL PROGR 111i\II',
WITH DATA PERTURBATIONS
May 16-18, 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 16-18 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-
Symposium on the Applications of
June 27-29, 1983
Registration information will soon be
available for the Symposium on the Applica-
tions of Discrete Mathematics, which will be
held June 27-29, 1983, at the Massachusetts
Institute of Technology in Cambridge,
Massachusetts. The Symposium is sponsored
by the Society for Industrial and Applied
The symposium is a follow-up to a
highly successful symposium held by SIAM
in June 1981 at Rensselaer Polytechnic
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) 564-2929.
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
Zero-One Integer Programming Solver;" and
Paul Zipkin (Columbia), "\.:_.. ,ili.. in
The schedule of talks for this spring is
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 Multi-Covering 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
"Location Problems and Networks with
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, on-campus parking can
be arranged if you call Barbara Korngold,
the administrative assistant for the Industrial
Fni.. rin and Operations Research De-
partment at 280-2941 at least two working
days before the meetings.
MPS members visiting the New York
area are welcome.
Department of I.E. and O.R.
New York, New York 10027
The tenth IFORS (International
Federation of O.R. Societies) conference
will be held in Washington, D.C., August
The theme of this conference is -
"Co-operation 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-
Mr. P. N. Belshaw
Canadian National Railways
O.R. & I.E.
P. O. Box 8100
Professor R. M. Soland
Department of Operations Research
School of Engineering and Applied Science
George Washington University
\\ .I.-Ir ..I D.C. 20052
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
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
Single-Server and Multi-Server 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," CP-82-065.
J. -P. Aubin, "Lipschitz Behavior of Solutions to Convex Minimiza-
tion Problems, "WP-81-076.
J. -P. Aubin, A. Cellina, "'I'll. n.l i Inclusions and Viability
J. -P. Aubin, "Fuzzy Games: The Static and Dynamical Points of
J. -P. Aubin, "Minimax Theory: A Summary," WP-82-061.
G. B. Dantzig, M. A. H. Dempster, M. J. Kallio, "Large-Scale Linear
M. A. H. Dempster, "The Expected Value of Perfect Information in
the Optimal Evolution of Stochastic Systems," WP-81-055.
Y. M. Ermoliev, "Stochastic Quasigradient Methods and Their
Application in Systems Optimization," WP-81-002.
Y. M. Ermoliev, G. Leonardi, J. Vira, "The Stochastic Quasi-
Gradient Method Applied to a Facility Location Problem," WP-81-014.
Y. M. Ermoliev, A. A. Gaivoronski, "Simultaneous Nonstationary
Optimization, Estimation and Approximation Procedures," CP-82-016.
Y M. Ermoliev, C. Nedeva, "Stochastic Optimization Problems with
Partially Known Distribution Functions, "CP-82-060.
M. Grauer, J. -L. Brillet, "About the Portability of the DIDASS-
Package (an IBM Implementation)," CP-82-004.
K. Kiwiel, "A Globally Convergent Quadratic Approximation for
Inequality Constrained Minimax Problems," CP-81-009.
K. Kiwiel, "A Variable Metric Method of Centers for Nonsmooth
A. Lewandowski, M. Grauer, "The Reference Point Optimization
Approach Methods of Efficient Implementation, "WP-82-026.
A. Lewandowski, "A Program Package for Linear Multiple Criteria
Reference Point Optimization," WP-82-080.
M. Makowski, J. Sosnowski, "Implementation of an Algorithm for
Scaling Matrices and Other Programs Useful in Linear Programming,"
L. Nazareth, "Analogues of Dixon's and Powell's Theorems for
Unconstrained Minimization with Inexact Line Searches," WP-82-100.
L. Nazareth, "Implementation Aids for Optimization Algorithms
that Solve Sequences of Linear Programs by the Revised Simplex Method,"
(continued next page)
Technical '". ..'ts ",'.i '',Au; .. continued
E. A. Nrininki, "On a Decomposition of Structured Problems,"
',V P-81-03 i.
E. A. Nurminski, "Decomposition of Two-Block Optimization
E. A. Nurminski, "Convergence and Numerical Experiments with a
Decomposition Algorithm," WP-82-008.
E. A. Nurminski, "Bibliography on Nondifferentiable Optimiza-
E. A. Nurminski, "Decomposition Algorithm Based on the Primal-
Dual Approximation," WP-82-046.
E. A. Nurminski, "Subtraction of Convex Sets and Its Application
in e-5, .., r, r. ,,, Calculus," WP-82-083.
E. A. Nurminski, T. Balabanov, "Decomposition of a Large-Scale
energyy Model," WP-82-095.
E. A. Nurminski, "Progress in ...,,.iit. r' ',,i.I. Optimization,"
R. T. Rockafellar, "Favorable Classes of Lipschitz continuouss
Functions in Subgradient Optimization," WP-81-001.
It. T. Rockafcllar, "Augmented Lagrangians and Marginal Values in
Parameterized Optimization Problems, WP-81-019
R. T. Rockafellar, R. J. -B. Wets, "Deterministic and Stochastic
Optimization Problems of Bolza Type in Discrete Time," WP-81-069.
R. T. Rockafellar, R. J. -B. Wets, "On the Interchange of ,..., i .
intiation and Conditional Expectation of Convex Functionals,"
R. J. -B. Wets, "A Formula for the Level Sets of epi-Limits and
some Applications," WP-82-081.
R. J. -B. Wets, "Stochastic Programming: Solution Techniques and
Approximation Schedules," WP-82-084.
R. J. -B. Wets. "On the Continuity of the Value ofa Linear Pro-
A. P. Wierzbicki, "Note on the Equivalence of Kuhn-Tucler Com-
plementarity Conditions to an Equation," WP-81-127.
UNIVERSITY OF BONN
Department of Operations Research
D-5300 Bonn 1, West Germany
M. Groetschel and M.W. Padberg, "Polyhedral Aspects of the
Travelling Salesman, Problem II; Computation, "WP 82214-OR.
M. Groetschel, M. Juenger, and G. Reinelt, "On the Acyclic Sub-
graph Polytope," WP 82215-0R.
A. Frank, "Disjoint Paths in a Rectilinear Grid," WP 82216-OR.
M. Groctscliel, M. Juenger, and G. Reinelt, "Facets of the Linear
Ordering Polytope, WP 82217-OR.
J. Araoz, J. Edmonds, and V. Griffin, "Lifting the Facets of Poly-
hedra, "WP 82218-OR.
M. Groetschel, M. Juenger, and G. Reinelt, "A Cutting Plane Algori-
thm for the Linear Ordering Problem, WP 82219-OR.
J. Araoz, "Packing Problems in Semi-Group Programming," WP
U. Derigs, and R. Schrader, "Some Greedy Ideas for the Cardinality
,i. i,,,. Problem,"WP 82221-OR.
U. Derigs, "Shortest Augmenting Paths and Sensitivity Analysis for
Optimal Matchings," WP 82222-OR.
M.D. Plummer and W.R. Pulleyblank, "Equi-Matchable Graphs,"
W.H. Cunningham and A. Frank, "A Primal-Dual Algorithm for
Submodular Flows, WP 82224-OR.
G. Morton, K. Ringwald, and R. von Randow, "A Simple Algorithm
for a Class of Quadratic Smoothing Problems," WP 82225-OR.
M.O. Ball and U. Derigs, "An Analysis of Alternate Strategies for
Implementing Matching Algorithms," WP 82226-OR.
A. Bachem, "Convexity and Optimization in Discrete Structures,"
M. Groetschel, M. Juenger and G. Reinelt, "Optimal Triangulation
of Large Real-WVorld Input-Output Matrices, "WP 82228-OR.
J. Araoz and E.L. Johnson, "Polyhedra of Multivalued Additive
System Problems, "WP 82229-OR.
H. Korte and L. Lovasz, "Greedoids a Structural Framework for
the Greedy il...,-il .n,,"WP 82230-01R.
J. Araoz and E.L. Johnson, l"t!.,-.r and Liftings for Group and
Semi-Group Problems," WP 82233-OR.
U. Derigs, "Optimale Zuordungen und ,'mtchiiins: Anwendungen,
Grundlagen und Verfahren, "WP 82232-OR.
J. Araoz and J. Edmonds, "A Case of Non-Convergent Pivoting in
Assignment Problems," WP 82233-OR.
S. Fujishige, it,. r of Submodular Programs: A Fenchel-Type
Min-Max Theorem and Subgradients of Submodular Functions," WP
U. Faigle, G. Richter, and M. Stern, "Geometric Exchange Proper-
ties in Lattices of Finite Length,"WP 82235-OR.
S. ,i.i-li,_.. "Structures of Polyhedra Determined by Submodular
Functions of Crossing Families, WP 82236-OR.
M. Juenger and G. Reinelt, "Techniques and Machines in the His-
tory of Computing," WP 82237-0R.
J. Araoz, W.H. Cunningham, J. Edmonds and J. Green-Krotky,
"Reduction to 1-Matching Polyhedra," WP 82238-0 R.
F. Barahona, "The Max-Cut Problem on Graphs not Contractible to
K(5)," WP 82239-OR.
J. Araoz, "Subadditive Characterization of Ordered ,, ...
Problems," WP 82240-OR.
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 82241-OR.
B. Korte and L. Lovasz, "Structural Properties of Greedoids,"
A.A.F. Oliveira and C.C. Gonzaga, "Convergence Bounds for the
'Capacity' Max-Flow Algorithm," WP 82243-OR.
I. Korte and L. Lovasz,"A Note on Selectors and Greedoids,"WP
U. Derigs and B. Korte, "Discrete and Cormbinatorial Optimization:
General Introduction," WP 82245-OR.
U. Derigs and B. Korte, "Independence Systems and Combinatorial
Optimization," WP 82246-OR.
U.Derigs and B. Korte, "Polyhedral Combinatorics and Cutting
Plane Methods, WP 82247-OR.
U. Derigs and B. Korte, "The Branch and Bound Approach to
Combinatorial Optimization Problems, WP 82248-OR.
U. Derigs and B. Korte, "Approximative Methods for Combinatorial
Optimization Problems," WP 82249-0 R.
R.E. Bixby, W.H. Cunningham and D.M. Topkis, "The Partial Order
of a Polymatroid Extreme Point," WP 82250-OR.
M. Juenger, W.R. Pulleyblank and G. Reinelt, "On Partitioning the
Edges of Graphs into Connected Subgraphs," WP 82251-0R.
A. Frank and E. Tardos, "An Algorithm for the Unbounded Matroid
Intersection Polyhedron," WP 82252-OR.
G. Gastou and E.L. Johnson, "Binary Group and Chinese Postman
Polyhedra, WP 82253-0 R.
A. Frank, "Submodular Flows, WP 82254-OR.
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," 81-2.
Paul T. Boggs and Jon W. Tolle, "An Implementation of a Quasi-
Newton Method for Constrained Optimization," 81-3.
UNIVERSITY OF COLOGNE
Department of Mathematics
D-5000 Cologne, West Germany
R. Euler, "Perfect Independence Systems," 81-19.
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.
Department of Econometrics
P. O. Box 90153
5000 LE Tilburg
A. J. de Zeeuw, "Hierarchical Decentralized Optimal Control in
Econometric Policy Models, RM 107.
A. Kapteyn and T. J. Wansbeek, "Identification in Factor Analysis,"
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."
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 Mini-Interplay, 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 Non-Linear 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. Al-Khayyal, "Jointly Constrained Bilinear Programming and
Related Problems," ISyE.
,. J. Bartholdi, Ill, "On the I'mlt.. iti of Finding Nice Subma-
trices," ISyE, 82-08 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, 82-07,
F. Cullen, J. J. Jarvis, and Hi. D. Ratliff, "IRG Interactive Route
Generator: A Narrative Description," ISyE, 82-15, PRDC.
R. G. Jeroslow and D. F. Karney, "Cluster Sets of Vector Series,"
D. F. Karney, "A Duality Theorem for Semi-Infinite Convex Pro-
grams and Their Finite Subprograms," COM, MS-82-4.
D. F. Karney, "The Number of Constraints in a Semi-Infinite
Program is Always Countable," COM, MS-82-5.
D. F. Karney and T. D. Morley, "Limiting Lagrangians a Primal
Approach," COM and Math, MS-82-3.
L. F. McGinnis, "Computer Aided Layout Programs: A Contem-
porary Appraisal," ISyE, 82-11, PRDC.
L.F. McGinnis and Rao, "Optimal Lot Sizing in Acyclic Multiperiod
Production Systems," ISyE, 82-10, PRDC.
L. F. McGinnis, R. J. Graves and Joneja, "Multicriterion Layout
Evaluation: The Value Measurement Problem," ISyE, 82-12, PRDC.
L. F. McGinnis, and Runyan, "A Computer Package for the Com-
posite Criterion Model," ISyE, 82-13, PRDC.
B. Montrieul, H. D. Ratliff and M. Goetschalckx, "Matching Based
Interactive Facility Layout," ISyE, 82-02, 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, 82-05, PRDC.
M. Pinedo, "Stochastic Shop Models with Jobs that Have Dependent
Processing Times at the Various Machines," ISyE, 82-09, PRDC.
H. D. Ratliff and T. Tran, "Optimum Four Module Pallet Packing,"
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.
C. A. Tovey, "Hill Climbing with Multiple Local Optima," ISyE, RR
C. A. Tovey, "Sensitivity of P I] Cmax with Respect to the Number
of Processors," ISyE, RR No. J82-8.
Systems Optimization Laboratory
Department of Operations Research
Stanford, CA 94305
Curtis Eaves and James A. Yorke, "Equivalence of Surface Density
and Average Directional Density," SOL 82-1.
B. Avi-Itzhak, T. J. Connolly, G. B. Dantzig, P. H. McAllister and W.
D. Winkler, "A Dynamic Equilibrium Model for Energy-Economic Plan-
ning, SOL 82-2.
B. Avi-ltzhak, T. J. Connolly, G. B. Dantzig, P. H. McAllister and W.
D. Winkler, "Mathematical Appendix: A Dynamic Equilibrium Model for
Energy-Economic Planning," SOL 82-3.
Klaus Schittkowski, "On the Convergence of a Sequential Quadratic
Programming Method with an Augmented Lagrangian Line Search Func-
tion," SOL 82-4.
B. Curtis Eaves, "Permutation Congruent Transformations of the
Freudenthal Triangulation with Minimal Surface Density," SOL, 82-5.
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 82-6.
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 82-7.
Mukund N. Thapa, "Optimization of Unconstrained Functions with
Sparse Hessian Matrices--Newton-Type Methods," SOL 82-8.
Patrick H. McAllister, "1982 EPRI Overview Planning Scenario
Results from the Pilot Process Integrated Model," SOL 82-9.
Richard W. Cottle and Steven G. Duvall, "A Lagrangean Relaxation
Algorithm for the Constrained Matrix Problem," SOL 82-10.
George B. Dantzig, "Mathematical Programming and Decision
Making in a Technological Society," SOL 82-11.
Frederick S. Hillier, "Heuristics: A Gambler's Roll," SOL 82-12.
Alan J. Hoffman and S. Thomas McCormick, "A Fast Algorithm
That Makes Matrices Optimally Sparse," SOL 82-13.
UNIVERSITY OF MARYLAND
College of Business and Management
College Park, Maryland 20742
Assad, Golden, "A Preliminary Framework for Urban Model-
Wolkowicz, "Generating Eigenvalue Bounds Using Optimization,"
Gass, "On the Solution of Linear-Programming Problems with Free
(Unrestricted) Variables," 82-038.
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," 82-040.
Golden, Gheysens, Baker, "Network Optimization Heuristics: A
Brief Overview," 82-041.
Skiscim, "Description of a Large Scale Network Simulation for
Digital Radio Networks," 82-042.
Assad, Golden, "Statistics in Optimization," 83-004.
Gheysens, Golden, Assad, "A Comparison of Techniques for Solving
the Fleet Size and Mix Vehicle Routing Problem," 83-005.
Trader, "A Bayesian Predictive Approach to the Selection of
Variables in Multiple Regression," 83-006.
Integer Programming and Related Areas
A Classified Bibliography 1978-1981
edited by Rabe von Randow
Lecture Notes in Economics and Mathematical Systems, Vol. 197
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
1976-1978 (Volumes 128 and 160 in the Lecture Notes in Economics and
Mathematical Systems), this one continues this important work for the
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
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
-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 discrete-time, finite-horizon 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 far-reaching tool which applies to a wide range of important problems
Starting from a well-chosen classification of the problems, the author
elaborates the essential principles and basic structures of the theory and
carefully reveals the inter-relationships 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
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
Books for review should be sent to the Book Review Editor, Prof. Dr.
Achim Bachem, Institut fir Operations Research, Nassestrasse 2, D-5300
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 multi-armed 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 risk-sensitive control). These
parts contain the major areas of discrete-time control theory as well
as many important examples such as: consumption-investment 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 (multi-armed 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
extended-real-valued 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
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 4-6 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.
C13L s ---- --
~ Il~~s~_ _s~ ll____s__~____~___E______~
Practical Methods of Optimization, Vol. 2:
by R. Fletcher
John Wiley, New York, 1981
This book is the second part of a two-volume 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 non-differentiable
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-, QL-method).
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 Matrices--Quasi-Newton 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 Tree-Search 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
J. J. Strodiot, V. Hien Nguyen and N. Heukemes, "e-Optimal
Solutions in Nondifferentiable Convex Programming and Some Related
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 Path-Following
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-
*Volume 26, No. I
M. J. Todd, "i a- ... il Linear Programming: Geometry, Working
Bases and Factorizations".
R. R. Meyer, "Computational Aspects of Two-Segment Separable
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, g-inverses, 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 design-matrix 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 well-chosen 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
M. E. Posner, "The Continuous -il.t ... Knapsack Problem".
S. J. Grotzinger, "On ( m.. .. i, in. L-Supports, Natural and
G. Huberman, "Error Bounds for the Aggregated Convex i ...-.
S. Halfin, "The Sphere Method and the Robustness of the I Ili- .i.'
*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, "Truncated-Newton Algorithms for
Large-Scale Unconstrained Optimization".
P. Loridan and J. Morgan, "Penalty Functions in -Programming
and C-Minimax Problems".
S. Komlosi, "Some Properties of Nondifferentiable Pseudoconvex
P. Zipkin and K. Raimer, "An Improved Dr'...-.r...r,,.., Method for
*Volume 26 No. 3
R. T. Rockafellar, "Marginal Values and Second-Order 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 Dantzig-Cottle's Principal
Pivoting Method for Solving LCP's".
R. E. Steuer and E-U. Choo, "Interactive Weighted Tchebycheff
Procedure for Multiple Objective Programming".
T. Ibaraki, "Parametric Approaches to Fractional Programs".
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-
Visitors at the Institute of Operations Research, University of Bonn during 1982-83
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 1983-84 post-doctoral 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 24-26,
1983 in Lyon, France on "Optimization in Computer-Aided 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.
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 33-221, POB 218, Yorktown Heights, NY 10598,
U.S.A; Telephone 914-945-1642, Telex 137456.
Some of these meetings are sponsored by the Society as part of its world-wide 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 212-883-7678.
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 5-10: 15th Conference 'Mathematical Optimization', Sellin/Rtigen, German Democratic Republic.
Contact: Dr. R. Hansel, Sektion Mathematik, Humboldt-Universitit zu Berlin, 1086 Berlin,
German Democratic Republic; telephone 203 2239.
May 13-14: '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 514-344-4884, Telex 05-24146 BIBPOLYTEC. Sponsored by
ACFAS, CAMS, IEEE, and the MPS.
May 16-18: '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 202-676-7511. Deadline
for abstracts, 1 March 1983.
June 20-21: 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 52-56/205, Palo Alto Research Laboratory, 3251 Hanover Street, Palo
Alto, CA 94304, U.S.A.; Telephone 415-493-4411, Extension 45677.
June 27-29: 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 215-564-2929.
July 4-15: Summer School on Combinatorial Optimisation, Dublin. Contact: Secretariat, Summer
School on Combinatorial Optimisation, National Institute for Higher Education, Glasnevin,
Dublin 9, Ireland.
July 11-15: 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, 01-447
Warszawa, Poland; Telex 812397 ibs pl, Telephones 364103, 368150.
July 25-29: 11th IFIP Conference on System Modelling and Optimization,'Copenhagen, Denmark.
Deadline for abstracts, 31 December 1982. Contact: Professor P. Thoft-Christensen, Institute
of Building Technology and Structural Engineering, Aalborg University Center, P.O. Box 159,
DK-9100 Aalborg, Denmark.