Title: Optima
Full Citation
Permanent Link: http://ufdc.ufl.edu/UF00090046/00006
 Material Information
Title: Optima
Series Title: Optima
Physical Description: Serial
Language: English
Creator: Mathematical Programming Society, University of Florida
Publisher: Mathematical Programming Society, University of Florida
Place of Publication: Gainesville, Fla.
Publication Date: March 1982
 Record Information
Bibliographic ID: UF00090046
Volume ID: VID00006
Source Institution: University of Florida
Holding Location: University of Florida
Rights Management: All rights reserved by the source institution and holding location.


This item has the following downloads:

optima6 ( PDF )

Full Text


March 1982

Number 6


Bernhard Korte, Bonn

In September/October 1981, at the
invitation of the Academy of Sciences of the
'-I, I visited some of their research
institutes and other academic institutions in
tlhe Soviet Union. Since mathematical
....i..miiiii activities in the I '.',11 are not
ioo familiar to the scientific community in
the West, it might be of interest to the
readership of this newsletter to report here
some of my personal impressions.
With the epidemic dissemination of'
tlie ellipsoid method in the West starting at
ai meeting at thlc Mathernatisches Forschung-
*:institut ()Oerwolfach in May 1979, many
-scholars in the fields of mathematical
programming have become more aware of
research results obtained in the Soviet.
Union. However, there has long been a
substantial and important tradition of
mathematical i .- .II...m. research in that
The reception and hospitality ex-
Iended to me by official representatives of
the Academy, as well as by colleagues at
different institutes, was really outstanding
and among the greatest impressions of this
visit. I visited academic and research institu-
tions in il -, Kiev, Novosibirsk
/ d..k.luleiorodok), and Leningrad where
t gave talks on my own research and survey
lectures. At some places those lectures were
translated from English into Russian by
colleagues. During the whole visit I was
accompanied by official interpreters of the
Original plans to visit places in Arme-
iia, Grusinia, Acerbajshan and Belorussia
had to be cancelled, since the necessary
technical and bureaucratic organization was
so time-consuming that it was not feasible
during the relatively short time I could
devote to this visit. The bureaucratic and
scientific organization is very much central-
ized in Moscow. Thus, for example, every
visit from abroad has to begin and end
there. One of the main purposes of this visit
was also to meet colleagues personally and

to invite them to participate inl and to
lecture at the Xltl International Symposium
on Mathematical Programming in August
I;';.' at the University of Bonn. I sincerely
hope that all these invitations will be accept-
ed and that all these leading scholars I11
eventually Ibe able to lecture at the syimpo-
In Moscow there are different institu-
tions at which mathematical ...,11.1 inain:
activities take place. !i ",. _', I .,_.d I', _n,.- ,-
i'.L i -.L. .- 1 i I i ll.. i I \Lj I headed by
Academician N.P. I ,l,.,,id .i has about
1100 persons -inpl.s1 .'1 among them 50
i....'1 .-I. and 250 candidates (researchers
with the second doctorate). Its main re-
search topics are: forecasting models,
general models for industrial complexes,
management information systems and "me-
chanics of economic functions" (the Russian
term for price systems). Mathematical
pI ll i..I:. ,niill.: topics are studied in the
department of Professor E. Gol'stein which
itself consists of three laboratories, one for
mathematical I'l .!i"""'ihii under his own
leadership, one for discrete optimization
under Dr. A.A. Friedman, and one for
probabilistic and stochastic methods. Profes-
sor Gol'stein and Dr. Tret'yakow have been
nl Ikin:: recently in the area of generalized
Lagrangians; while the group on discrete
optimization, in which Dr. Finkelstein, Dr.
Frumkin, and Dr. Levner also work, deals
mainly with complexity studies and .Is In.I.
ic problems in discrete optimization. During
the time of my visit, CEMI moved into a
new modern building, in which the conm-
puting facilities of the institute, an ES 1060
and ES 1022, are located. (In what follows,
I will return to the subject of computer
equipment in the USSR.)
I. Coinputinlg (Center of tlte'
Academy is under the directorship of
Academician A.A. Dorodnicyn. Here the
department of optimization is headed iby
Deputy Director Professor Y. Evtushlenko.

Formerly Deputy Director Professor N.N.
Moiseev was in charge of this department.
lie is now responsible for applications. The

I 'll'

Sita Itili xi iLS. 11 111 I \tita"
,i n,'( i iatgr,,Itgiatt I)' o l x '
| .. 1 . .I I .. I. .' I

optimization grouvlp at thlic Computing
Center is quite strong and has become
well-known as tihe place where l)r. L..
Klhachiyan works. This group works mainly
on nonlinear optimization methods, gseneral-
ized Lagrangians (I)r. (;olikov). Newton-
type methods for nonlinear equations (Dr.
Burdanov), interactive NLP'-softwaret systems
(Dr. V. Mazurick), conmbinatorial poiyhedra,
especially travelling salesman polytopes (Dr.
V. Leont jev) and combtinatorial optimization
(Dr. S. Tarasov). Naturally, during my first
meeting at this institute, I asked to meet
with Dr. Khachiyan. One of thle first corm-
meits about hini by a senior scientist was
simply: It is an ordinary mathematician."
I I.- demonstrates to a certain extent that
his work is perhaps not as muchi recognized
and acknowledged there. E ,, II, arranlge-
Ients were inade for a meeting with him
and we had anl i intensive discussion about the
ellipsoid method and its extensions. IHe was
very well aware of the :.11 I ], papers on
this method, especially its consequences for
comnbinatorial optimization. Ite lad a special
greedy-type argument for the fact that a
fully dimensional polytope is not necessary
for tilhe method, as well as for the equiv-
alence proof of separation and optimization.
(HIe prefers not to use the polar but rather
the space of objective functions.) lie is a
,,u,. impressive mlan whose appearance
certainly reveals his Armenian descent. I was
impressed by his very good knowledge of
Continued Overleaf-

I)--: ' -- '- '' ''--'
1'"1'11 1111111 1111 111 '1.1111'(1

~ I'"r\lL''."I 111.111.111).. 111'(111(111
111'.'.11111. 1111( 111111.1 1111(.(1.~11111~ )1l1!1I
11.1- IIIIII 111 11I'I1 11l \II'L 1:11.11~)1.1. )).I1
1111 1111)'11 .111 1111111 )11 .IllJI1i .IIII)
l1lI.I1 IIII1"I.III1 11111111111111111 !)(1111111.1(1(

III Il. ii) I 'III : lIiIII 1.I1 11.((11.1 '~III 1.
'. JII I .I I i' I 'IIII Ililllll.l; II.II '. j I i'l

different areas of mathematics. It was very
interesting to 11 with him and. by the way,
lie spoke good IEnglish. Perhaps lihe is some-
what too noiicolformist for his rinvirotn-
n11 i t.

The optimization group at the Cont-
puting Center is very active in developing
interactive software systems for nonlinear
.... nniii. With these pI I 1'.,-. -. which
contain all well-known optimization tech-
niques, lthe user can choose from a terminal
display an appropriate method or subrou-
tine i. p" rlini:. on tile particular problem.
Since I had the chance to study this in
detail, I also learned about the computing
facilities of the Center. It still has three
1!1 -' 1 computers with a 220 K word nmem-
ory. !.,. model is by now almost 20 years
old and about equivalent to the CDC 3200.
It is run under a mllti-partition operating
system with 16 partitions and it includes
interactive features. The more up-to-date
computer models in the USSR are those of
the series ES, which is a joint production of
all COMECON countries. Its disks are
produiced in l;lii'.IiII and are similar to the
old IBM 2314 with a capacity of seven
megabytes. iThe printers are usually manu-
factured in Poland, the video displays in
*.... '' -, the tape equipment in the DDR
and tile central units, .'-p'-iilin. on the
various models, in different countries but
predominantly in the USSR. This ES family
is very , with a maximal power in the in.': of the
370/135. It was frankly admitted that the
hardware technology of Soviet computers is
below the current world standard, but this
gives rise to more sophistication in imple-
mentations and software development.
-As a curious historical reminiscence,
it can Ihe added here that, V.I. Lenin was one ,
of thie first owners of' a personal computer.
In the Lenin museum at tle Red Square ill
Moscow, I had a close look at this rare
object, a Thomas Arithmomete r built by
Charles Xavier Thomas de Colnar around
the middle of the last century.
At a seminar which I gave in Moscow,
I had the chance to meet Dr. A.S.
Nemirovskij. lie is also relatively -,..i:ii and
his work on oracle techniques to prove tlhe
polynomiality of certain algorithmic ap-
proaches is quite impressive. As is well-
known, this framework led to the proof that
the ellipsoid method is polynomial for linear
;. Illoinill. His book (Conplexity of
Optimization ;'. .' ..- andl Efficiency )of
Irt Methods, coauthored by '*.... ...
D).;:. Judin, contains more complexity and

oracle results tian known from tle ',._I; tL
versions of their papers. Fortunately, anl
English translation of this book is in prepara-
tion. According to opinions of Soviet
I .. p, ...- L.G. Khachivan and A.S.
Nemirovskij are among the very best junior
scientists in the area of mathematical pro-
.1 iII,, i. in the Soviet Union, and this
also coincides with the acknowledgement of
their work in the Western world.

At the Institute of Control of lthe
Academy iln Moscow there is also a small
group dealing with mathematical program-
ming and particularly with nondifferentiable
optimization. This work is mainly done by
I)r. Boris Poljak and his ..l.. Finally, I
should m mention tllh II I .... I,-1 I'1 I..,
System Studies in Moscow, which is not a;
direct institute of the Academy but soile-
what related to it. Academician and Nobel-
laureat'e L.(. Kantorovitch, whlo was forlm-
erly at Novosibirsk, is now head of a labora-
tory at this institute. Various activities ill
continuous s I a il discrete optimiza-
tion are going on there and in related re-
search seminars. The group in discrete
optimizatiion made a very strong impression
on me. I I '. II., i research results, inll
particular on network flow problems, have
been known and appreciated in the .' I for
years. This group mainly consists of Drs.
.A. Dinic, P. Grisliihin, A\.W. Karsontov,
A\.K. Kelnans, A. LomnonIosov and P.A.
Pevsnir. They have issued several volumes of
.ilt, i. .( papers. ,Some of theiem are also
known (and translated) in the WSest. Right,
nowt thev are working on generalization of
thie two-coniodity-flow prob)lel to a
amulti-conunodity one where, under (certain
assumptions for tlhe source-sink pattern, a
i ax I .. i ....... l i result still holds, tbut of
course lnot with integral flow vall s.
My visit to Novosibirsk was a lkrin.,
experience. After a fli.:li of 12 hours with
an unexpected stopover at Omsk because of
weather conditions, 1 was received at the
airport by members of the Siberian Branch
of the Mathematical Institute of the Acad-
emy. A further car ride of about one hour
brought us to the "academic Il,...-"
Akademgorodok which is 45 kilometers
away. This little city was built about 20
years ago exclusively to host ,.,niIl.
institutes of the Academy. It now has
60,000 to 80,000 inhabitants and the
iiifrastruclure is, to a great extent, fornied
by its academic purpose. (I find it hard to
decide whether academic life should be
integrated in, or isolated from, other social
structures as is known a similar experi-

menli was started in France at Sophia-
Antipolis. Although concentration and isola-
tion of academic life has considerable
advantages and li.,..::i,. there are historical
models in ancient loniasteries, I personally
prefer its implementation in normal social
structures to prevent the establishment of
subcultures. And I have to confess that imy
opinion was reinforced. But, of course.
this is a very personal view.) Scientists and
other personnel in 'a, -Ilii.i'.orodok live in
normal 4- or 6-story !iwildii while acade-
micians and leading senior scientists often
have their own datscha, a little house with 5
to 6 rooms.

In its early I i. mathematical pro-
n....... ._ w as brought to A l ,I. ,- ..... I..!
by Academnician Kantorovitch froi the
Len(ingrad school. Some of his former
students like G.S. Ribinstcjn and A.A.
K plan are now ..-.d-,. li,,. it. F.... i .iil the
mathematical group is part of
the Miathelmatical Institute under Academi-
cian S.I,. Sobolv. This institute consists of
three departments: mathematics, cy'bernet
ics, and mathemlatic(al economics. "Convex
Analysis and I I . of Extremal Problelms"
is a subdivision of Lhe latttr, headed by
',.. ..... luH binstejn. I I group is very
strong inl the theory and algorithms of
convex p()limizalion, particularly special
qualityy andi separation theorems (Prof.
Hubinstlcji), penalty mllethods (Dr. Kaplan)

transportation problems in which a certain
Monge-plroperty (greedy) was used.
Professor (;.I. Marshuk who was
formerly the director of the Computing
Center in ..... ii !., and who is well-
known in the areas of optimization and
control, entered a very '..... i in. political
career. lie is now Deputy Prime Minister of
thle USSR.
Kiev is ........II reached by an over-
night ride in a sleeping car from Moscow.
h I. [ mainly visited the lnstitLut_'of ( r
= I, I I . . l 1 ii , ,, I. r . I ,, : ,
This institute became fainmos in the West
since it is the place where Dr. N.Z. Shior
works. He is in his late forties and has a vcry
lively facial (:expression and a vivid appiar-
ance. His mathematical approach is more of
an engineering type. Yet, his interest and
knowledge in mathematics is remarkably
broad and deep, which can be demonstrated
by the fact tllat hle is jointly writing a book
Contimnled "

about algebraic characterizations of the
four-colour problem. \\ had ample time for
several discussions (which had to be trans-
lated by a colleague) and he explained to me
the origin of the I-..-..i method. It was
first developed as a subgradient method for
generalized (nonlinear) transportation prob-
lems, for which lie then invented the dila-
tation of space approach which eventually
leads to the ellipsoid method, lie did some
numerical implementations of this method
and he also states that it does not compare
with the simplex method for linear program-
minig. On the other hand, he believes in his
recent modification of the II, .... I method
which lie calls the r-method (and which uses
gradients of two violated hyperplanes).
Although the theoretical convergence of this
modification is the same as of the original
ellipsoid method, Ihe claims to observe an
empirical complexity of 0(n ) which again
is comparable to that of the simplex meth-
od. About this I personally have some

The IIL-iIII, *- l 1\ i"' .I-I-i has
about 6000 members, of which 2000 are
, ,,,h,|,.1 in its scientific branch and 4000
in its v.':ii'..liii- department, which besides
special constructions for industrial use, is
also engaged in d-.-i.-iini electronic LSI
chips. Academician V.M. Gluskov is the
director of this institute; Academicians V.S.
Michalevitch and A.A. Bakajew are deputy
directors. Very recently all leaders of the
institute, together with Dr. Shor received a
state prize for the ellipsoid method and their
work in mathematical programming. During
my stay in Kiev, I was hosted by Professor
Bakajew and his son. Their hospitality was
outstanding and the visit was extremely
The research area of mathematical
programming is located in the department of
Professor Michalevitch in which Dr.
Pscheschnitchny (subdifferential optimiza-
tion), Dr. Ermnoljev (stochastic program-
ming) and Dr. Shor are heading subdivisions.
Other researchers in this area are Dr.
Gershovitch (subdifferential optimization
and dilatation of space methods), Dr.
Trubin (combinatorial optimization), Dr.
Kuksa, Dr. Laptin, Dr. Tschurbenko aind
Professor Wolkovitch (cutting plane and
branch and bound methods for linear aind
integer p1 'i. rII;,, I This group in Kiev
whose main research area subdifferential
optimization made them famous, is cer-
tainly among the very strongest groups in
mathematical li..:. ,,,ini;._ in the USSR.
In Kiev, I also learned that the famous

van der Waerden conjecture was not proved
for the first time by r::iii l.h from
Krasnojarsk as it was believed in the western
world for several months. Falikman from
Kiev is credited with the first proof. He did
not even use the Alexandrow inequality in
his proof.
Leningrad, within easy reach of
Moscow by a night-train, was, from a tour-
ist's point of view, the most interesting place
I visited. Its cultural and historical back-
ground is still evident today. The appearance
of the city with its canals, the famous
museums, and the very painstakingly re-
stored czarist residences in their surround-
ings are impressive. Compared with the
Hermitage, many museums all over the
world seem to be provincial. As already
mentioned, mathematical programming in its
early stages was done at the University of
Leningrad. It should be mentioned that
some former students of 1.. Kantorovitch,
such as Professor Romanovski, are still there.
T h e I ., T ... 1, ..f il 1 .,i l i .1;. .,I
Ih, I; I,. . 1. .. is doing studies in
coni iputational comnilexity, mainly carried
out by l)rs. -I.. l I anid Grigoricv. By a
... i. j;I. of different institutes of the Acad-
em y th e 1 i;i i .f ; ... .. ... ..... ;. .11
-. _i . was formed Iere a research group in
game theory and optimization, headed lby
Professor Vorobjev, includes Dr. A. Korbut
who is working on discrete optimization.
This short report can only imperfectly
characterize my very personal and limited
experiences. And, of course, very many
impressions scientific as well as personal -
are not related here. 0


Newsletter of the Mathematical Prograrm-
ming Society
Donald W. Earn, Editor
Achim Baclhem, Associate Editor
Published by the Mathematical Programming
Society and Information Services of the
College ofFii,.; ... ;,. University of Florida.
Composition by Lessie McKoy, and Mech-
anical Production by Dick Dale.


17-19 MAY 1982

A Fourth Symposium on Mathelmat-
ical Programming with Data Perturbations
will be held at The George i', Iii,_...
University's Marvin Center oin 17-19 May
1'". This symposium is designed to bring
together practitioners who use mathematical
programming optimization models and deaal
with questions of sensitivity analysis, with
researchers who are developing techniques
applicable to these problems.
Contributed papers in mathematical
programming are solicited in the II.. ;
(1) Sensitivity an stability analysis results
and their applications.
(2) Solution methods for problems involv-
ing implicitly defined problem funli-
(3) Solution methods for problems involv-
ing deterministic or slochiastic para-
nmeter changes.
(4) Solution approximation technliquies
and error analysis.
"( .... I" presentations are also in-
vited that describe problems in sensitivity
or stability analysis cincounitercd in applica-
Abstracts of papers intended for pre-
sentation at the Symposium should be
sent in triplicate to Professor Anthony V.
Fiaeco. Abstracts should provide a good
technical summary of key results, avoid the
use of mathematical symbols and references,
not exceed 500 words, aind include a title
and the name and full mailing address of
each author. The I Ili .... for submission of
abstracts is 1 March 1982.
Approximately 30 minutes will be
ili..i. I for presentation of each paper. A
blackboard and overhead projector will be
A proceedings of selected papers is
planned for publication as a special issue of
the Marcel Dekker journal, Numerical
Functional Analysis and Optimization,
edited by M.Z. Nashed. If a sufficient
number of other papers arec presented that
deal mainly with applications, these will be
organized in a separate volume for another
appropriate publication. The complete text
of all I...... .1 contributions must be
submitted before the conference convenes.
---Anthony V. Fiacco



April 9-13: Meeting of the TIMS Special Interest Group on Multiple Criteria Decision Making, Mons.
Contact: Pierr Hansen, Facult6 des Sciences Economiques, Facultd Universitaire Cahtolique de
Mons, Chauss6e de Binche, 151, B-7000 Mons, Belgium.

April 13-17: Workshop on Algebraic Structures in Operations Research, Bad Honnef, Federal Republic
of Germany. Abstracts due March 1. Contact: Professor R.E. Burkard, Institut ftir Mathema-
tik, Technische Universitit, Kopernikusgasse 24, A-8010 Graz, Austria.

April 26-29: SIAM Special Conference on Applied Linear Algebra, Raleigh, N.C., U.S.A. The
Conference is devoted to five areas of applied linear algebra, one of which is "Operations
Research and Optimization". Abstract deadline 30 November, 1981. Contact: Hugh B. Hair,
Society for Industrial and Applied Mathematics, 1405 Architects Building, 117 South 17th
Street, I'liii Iil1,., PA 19103, U.S.A.; telephone 215-564-2929.

May 13-14: "Optimization Days", Campus of the University of Montreal. Contact: Professor Jacques
Ferland, Centre de recherche sur les transports, Universit6 de Montr6al, C.P. 6128, Succ. "A",
Montreal, Quebec, Canada H3C 3J7; telephone 514-343-7575. Deadline for abstract,
January 31, 1982. Sponsored by IEEE, ACFAS, SIAM, SCMA, and the MPS.

May 17-19: "Fourth Symposium on Mathematical Programming with Data Perturbations", The George
\ .1 lii] I;. University, Washington, D.C., U.S.A. Contact: Professor Anthony V. Fiacco,
Department of Operations Research, Deadline for abstracts, 1 March 1982. School of
Engineering and Applied Science, The George Washington University, Washington, D.C.
20052, U.S.A.; telephone 202-676-7511.

August 23-28: Eleventh International Symposium on Mathematical Programming in Bonn, Federal
Republic of Germany. Contact: Institut fir Okonometrie und Operations Research Universitit
Bonn, Nassestrabe 2, 5300 Bonn 1, Federal Republic of Germany; Telex 886657 unibo b,
Telephone (02221) 739285. Official triennial meeting of the MPS. (Note: The International
Congress of Mathematicians will be held August 11-19 in Warsaw, Poland.)

October 25-27: Sparse Matrix Symposium 1982, Fairfield Glade, Tennessee, U.S.A. The Symposium
will address the construction and analysis of algorithms and mathematical software for sparse
matrix calculations and associated applications, one of which is 'Optimization'. Abstract
deadline 1 July 1982. Contact: Robert C. Ward, Union Carbide Corporation, MSRD,
Computer Sciences, P. O. Box Y, Bldg. 9704-1, Oak Ridge, Tennessee 37380, U.S.A.;
telephone 615-574-3131.

October 20-21: Third Mathematical Programming Symposium Japan, Tokyo, Japan. Recent Advances
in Mathematical Pf._-r.,nmiiin Mathematical Programming Software, and Applications.
Contact: Professor Masao Iri (Chairman, Organizing Committee), University of Tokyo,
Bunkyo-ku, Tokyo, Japan 113, or Professor Kaoru Tone (Chairman, Program Committee),
Graduate School for Policy Science, Saitama University, Urawa, Saitama 338, Japan.


July 11-15: 3d IFAC/IFORS 2 Ii." "i.,1 "Large Scale Systems: Theory and Applications", .' .n ..,.
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 pi, Telephones 364103, 368150.



The Mathematical Programming Society
is beginning its planning for the Twelfth
International Symposium on Mathematical
Programming, which it proposes be held
about the last week in August, 1985, some-
where in the world other than Europe. It
wishes hereby to invite all parties who
might act as hosts to this event to make
their interest known to the Society's Sympo-
sium Advisory Committee.
The Symposia have been the principal
occasions on which large groups of the
world's researchers on that subject have as-
sembled. Since their beginning in 1949
they have i..Ili grown in size. About
250 papers were presented at the Eighth
Symposium, August 27-31, 1973, at Stan-
ford, California; 330 at the Ninth, August
23-27, 1976, in Budapest; and 450 at the
Tenth, August 27-31, 1979, in Montreal.
We can expect even more at the Eleventh
Symposium in Bonn, Federal Republic of
Germany, August 23-28, 1982.
The Society's practice with regard to the
Symposia has been to give the host commit-
tee considerable autonomy in the whole af-
fair. The Society has some guidelines for
conducting the Symposium, traditions it
wishes to maintain, and a large body of ex-
perience on which the host can draw. (The
committee members are all organizers of
previous Symposia: E.M.L. Beale, R.W.
Cottle, J.-L. Goffin, A. Orden, and A. Pre-
kopa.) The Symposium is expected, through
its registration fee and institutional subsid-
ies, to be self-supporting. The Society can
lend 'seed money' to the Symposium or, to
a limited extent, guarantee it against loss.
The host may organize Proceedings of the
Symposium as one or more Mathematical
Programming Studies. (', .... i... were
not compiled for all Symposia.)
There are no fixed criteria for the selec-
tion of a site. The more important consid-
erations are: technical qualification and en-
thusiasm of the local staff; adequacy of the
meeting facilities; availability of nearby
lodging; reasonable travel and local costs --
in short, those factors that will lead to a
productive conference that will appeal to a
wide range of participants.
We hope that several suggestions for the
Symposium site will have been made by Au-

gust, 1982 so that they can be discussed at
the Society Council meetings to be held in
Bonn. The Council hopes to make a final
determination shortly thereafter. Interested
parties should communicate with some
member of the Committee as soon as possi-
ble on this matter as well as on the possibil-
ity of holding other meetings under the
sponsorship of the Society in intermediate
Professor Jean-Louis Goffin, Chairman
MPS Symposium Advisory Committee
Faculty of Management
McGill University
1001 Sherbrooke Street West
Montreal, Quebec H3A 1G5

New York

I I. 10th IFll' Confcrence on System
'.1. ..I hn,_ and Optimnization took place at the
New York Sheraton Hotel in New York
City, August 31 through September 4, 1981.
The Conference was organized for the Tech-
nical Committee 7 ol the International
Federation for Informiation Processing by
the host university, the Polytechnic Institute
of New York, 333 Jay Street, Brooklyn,
New York 11201.
The aim of the Conference was to
bring together persons engaged in studies
dealing with the modeling and the optimiza-
tion of technological, managerial, socio-
economnic, and bio-mredical systems. It was
hoped that this broader scope would enable
specialists from various fields to be exposed
to the research objectives and methods
used by others.
\nAmong the 14 invited addresses were
the following related to mathematical
progralming: S.W. Director (Carnegie-
I. II ii., l, The Role of Optimization in VLSI(C
design ; R.M. Karp (Berkeley), The Inherentc
Complexity of Combinatorial Optimization
Problems; F. Clarke (British Columbia),
Non-Smooth Analysis and Optimization.
There were 210 contributed papers
1iven in 32 specialized sessions, including
several devoIted to topics in mathematical
programming andl its applications.
The Conf erence was somewhat un-
usual in that almost 60% of those attending
caine from abroad. In fact, thirly-onc
coullntrie were represented aInong] its partic-
ipant s.
-H.ID. )reniek


The "Second Mathematical Program-
ming Symposium Japan" was held In Kyoto,
Japan, November 19 & 2(, 1981, organized
by a committee under the direction of Pro-
fessor Masao Iri of Tokyo University and
Professor Toshihide Ibaraki of Kyoto Uni-
versity. Most of the 140 attendees were
from Japan; China, Canada, and the U.S.A.
were also represented.
The fourteen papers presented were of
high' standard, both in theory and applica-
tions. Twelve were read in Japanese and
two in English. They are given in full in
the Proceedings (ten in Japanese, four in
English), available from the Operations Re-
search Society of Japan, Gakkai-Center
l,,ii.i, 2-4-16 Yayoi, Bunkyo-ku, Tokyo
113, Japan. Philip Wolfe

The 3rd -i hillh iki.tlti Pr n min', i,-.
Symposium in Japan

Since 1980, the annual Symposia on
Mathematical Programming have been pro-
mooting research in, and applications of,
mathematical programming in Japan.
I I. 3rd Symposium i11 be held on
October .'1i -1, 1982, at thle Tokyo Norin
Nenkin Kaikan in Tokyo. Professor G.B.
I)antzig of Stanford iUniversity will attend
and give a talk at tlihe Symposium as thl
main guest speaker. Several tutorial lectures
onl recent advances in mathematical pro-
granmminng will be delivered, and invited
papers on participants' original works ,ll be
presented in the ..11.. i sessions:
L. Recent Advances in Mathemnatical
Progranuning: Session ( ll .....1
H. Konno,
II. M atiheml atical 'i.._ i ....i .. Software:
Session Chairman K. Ono, and
111. Applications: Session ( I ..... 1
R. Manabe.
Participation froin abroad is welcome. 'Those
interested are requested to contact the
() ini Conu ittee 1I ...... ... Professor
Masao Iri, IUniversity ofl'Tokyo, llunkyo Ku.
Tokyo, Japan I 13) or the Programi Commit-
tee (Chairllan: Professor Kaoru Tone,
(;radlluate School for IPolicv Science. Saitanma
University, lUrawa, Saitama Japalln)
Kaoru Tone

i\rca1 Repo t u

College of Business and Management
.M.... Park, Maryland 20742

Gass, "Decision-Aiding Models -- Validation, Assessment, and
Related Issues, 81-022.
Golden and DeArmon, "Algorithms for the Capacitated Chinese
Postman, 81-024.
Assad, "Nested Optimal Policies for Set Functions with Applica-
tions to ,. ,I ....,"81-025.
Ilsner, .iohnson, lHoss and Schi'nheim, "On A Generalized Matching
Problem Arising in Estimating the i: ..... ',*' Variation of Tiwo Matrices,''
Froniovitz and Loeb, it. i. t,'. Selected Audit Report Decisions:
A GaCne Theoretic Approach," 81-028.
Trader, "A Bayesian Technique for Selecting a Linear ; .. ....
Model," t 1 -031.
Golden, 'DeArmion and Baker, "Computational Experiments with
'i. .i..'. for a Class of Routing Problems, 81-033.3
Bodin, ole, Assad and Ball, "The' Slate of Thei Art in the Rout-
ing and Scheduling of Vehicles and Crews," 81-035.
Assad, "Analysis of Rail Classification Policies." 81-037.
Golden, Assad, Hurton, Grove, llanley, Ioln, lleinlzelnman anil
Myers, "A Preliminary Eramework for Urban 1I i. I I.,I I-... 81-038.
Ball, Assad, Bodinl, Goldlen and i. I.. i. "Garage Iocation for an
Urban Mass Transit System," 81-039.
Golden and Slewart, "The Empirical Analysis of TSP HeIuristics,"
Derigs, *l1.,I. ... Code Theory Part I Combinatorial Structures
and the Cardinality Matching Problem, 81-041.
Derigs, I .. ...' and Time-Cost-T. i. -. for Transportation
Solu tions," 81 -042.
Derigs, "Another Composite Heuristic for Solving Euclidean Travel-
ing Salesman Problems, 81-043.

Systems Optimization Laboratory
Department of Operations Research
Terman Engineering Center
Stanford, CA 94305

Gregory Dobson, "Exact and Approximation Algorithms for a
Scheduling Problem, Sol 81-9.
Alan J. Hoffman and Jean-Louis Goffin, "On the Relationship
Between the IIausdorff Distance and Metric Distances of I IIt .I ."
Sol 81-10.
Frederick S. H1illier, "A Further Investigation of i l,. .r lHeuristic
Procedures for Integer Linear Programming with an Interior, Sol 81-11.
M.N. Thapa, "Optimization of Unconstrained Functions with Sparse.
Hessian Matrices," Sol 81- 12.
Alfredo Noel lusem, "Continuous Time Linear Programs with
Economic Applications, Sol 81-13.
Alfredo lusem and I -., ....... Avi-Itzhak, "On Utility Functions with
I i,.' IDemand Curves, Sol 81-14.
Alfredo lusemn, "Energy Demand Elasticities," Sol 81-15.
J.-L. Goffin, "Variable Metric Relaxation Methods, Part I: A Con-
ceptual Algorithm," Sol 81-16.
Nathn Blras, "A Study of Water Resource Constraints on Energy-
Related Activities," Sol 81-17.
Bizhan Binesh, "Rleinitialization of Macroeconomic and Energy
Conversion Sectors of the Pilot Model," Sol 81-18.

Centre de Recherche sur les Transports
Case Postale 6128, Succursale A
Montreal, Quebec, H3C 3J7

Michael Florian and 'Marc Los, "'A New Look atl Static Spatial Price
Equilibrium Models," CRT 1 96.
Michael Florian, "The Convergence of il'. .... 'I Algorithms
for Iixed Demand Asymmetric Network Equilibrium Problems," CRT -
Patrice Marcotel, "An Analysis of Heuristics for the Continuous
Network Design Problem, CRT 200.
Christian Lardinois, "Statistical Inference with Large Combinatorial
Problems: Estimation of the Exact Optirmumin and a i ... Rule for the
Heuristic Exploration, CHT 201.
Sanm Nguyen and ClermonI Dupuis, "'An ii ..... Method for
Computing T i,., Equilibria in Networks with Asymmetric Transporta-
lion Costs, CRT 205A.
(lermont Dupuis, "Ulne A.pplication de la Technique D'Approxima-
lion Lineaire Partielle en Programmation (Conv xe, CRT 216.
Lourdes Zubicia, "Une Nouvelle Approache au Probleume de Mlaxi-
inisation itu I' lot Dans an Reseau AI Plusieurs Cormmodites Avec Capac-
ites Variables," CRT 212.
Gilbert Laporte, Yves Nobcrt and Paul Pclletier, "larmiltonian Loca-
tion Problems, CRT 224.
Sang Nguyen, "Modeles de Distribution Spatiale Tenant Compte
des Itineraires," CRT 225.
Patrice Marcotle, "Network Optimization with Continuous Control
Parameterss" (CRT' 226.
Teodor Crainic, Jacques -A. Fe'rland and Je'an-Marc Rousseau, "A
(General Supply Model for Rail ; ... -ii Transportation," CRT 228.

Department of Operations Research
Nassestr. 2
D-5300 Bonn 1, West Germany

IB. Korte, "Matroid Properties and Matroid Oracles," WP-81200.
R. Sclrader, "Approximations to Clustering and Subgraph Problems
on Trees, WP-8 1202.
W.H. Cunningham, "Polyhedra for Composed Independence Sys
teams WP-81203.
W.H. Cunningham, "A Class of Linear '.. _, -.i Convertible to
Network Problems," WP-8104.
A. Frank, t I .... Feasible Vectors of Edmonds-Giles Polyhedra,"
A. Frank, "Generalized Polyrratroids," WP-81206.
W.H. Cunninghlam, "Testing Membership in Matroid Polyhedra,"
U. Derigs, "A Shortest Augmenting Path Method for Solving Min-
imal Perjfct Matching Problems, WP-81 208.
A. Frank and E.Tardos, "Matroids from Crossing Families,"
M. (;Grltsclhcl and .1L. Nenihausrr, "A Polynomial Algorithm for
the Miax-Cut Problenm in Graphs Without Long Odd Cycles," WP-82211
M. G;rdtschel and M.W. "',,li... "TSP Polyhedra," WP-82212.
W.H. Cunningliam, "Decomposition of Submodular Functions,"
(All titles of the working papers WP-7201 WP-81200 will be
available under WP-81201.)

r' 7ECH.CF. A.L J PC'V &i

Department of Electrical Engineering
Baltimore, MD. 21218

Vitit Kantabuta, "Traveling Salesima Cycles are not Always Sub-
graphs of Voronoi Duals," Jlit[ EE I8 5.
Joseph )O'Rourke and Kenncth J. Supowit, "Somr NPl'-ard Poly-
gon Decomposition Pro blems, "Jl. EE 81 13.
Mikhail J. Atallah, "NIew Rsiults oin Minimal Graphs," JIlll EE -
81 14.

Department of Business Studies
William Robertson Building
50 George Square
Edinburgh E1H8 9JY

11.P. Williams, "A Characterisation of /ll Feaosible Solutions to (an
Integ'er Progrnamrmn," 1981.
II.P. Williams, "A Duality Theorem for Linear Congruences," 1981.
11.P. Williams, (Crashing Proceduro for Lner L I'inn roramntiniig
derived from Fourier-Motzken Elimination," 1982.
HI.P. Williamns, "Models with Network Duals," 1981.

Department of Industrial Engineering
and Management Sciences
Evanston, II. 60201

R.E. I i "Matroids and Operations Research. "
R.E. liixly, "A Simple Theor!em on 3-Connectivity. "
R. Fourer. "Notes on 'Se'mi-Linear' Programming," July 1981.
IR. Fourer, i 1i. ... Languages versus Matrix Cenerators for
Linear Programming, revised December 1981.
(.B. Hazen and T.L. Morin, "Optimality Conditions iin onconical
Multiple ( ,. ,
(G.B. Hazen, "A Convexity-Based ; ii, tr.. Strategy for
Multiple r ,. -, Optimization," l)ecember 1980.
G.B. Hlazen and T.1. M iorin, "Steepost IAlgorithm's or
ionconical ilultiplie ( ,.1 ...... "'Jai arn 198l.
W.-I. lisu, I I,. :.i. Perftct (raph Conj(,ecurv oil Special
Graphs," May 1981.
W.-L. Hsu, "Approximation ,,....' for thli Assembly Line
Cr' w Scheduling Pro blemn" September 1981.
W.-L. Hsu. "Th D)istance-D nomination Numibers of Trees."
November 1981.
W.-L. 1Hsu, A. Naamad and D.T. Lee, "On the Mlaximum Empty
Rectangle PIroblerm," December 1981.
A.P. Hurter and J. Martinich. "Price 01 certainty and the Oplintal
Production-Location Iecision. '
A.P. tHurter and E. Venta. "ProdctltionI L catioin 'Pro'ibms."'
A.P. Hurter. "Uncertainty, Bias, and Frrors ill iost
Analysis. "
P.C. Joner, "A Aot, on thi Talman, Van dor Hlhydvn L,inrar Corn-
pirinentarity Proble, November 198 1.
R. Saigal. "A. .. for "Solving Lar p1 irst and 'tricturedl
Fixeid Point Problems," ailliarv I 81l.
I. Saigal. "Ain .' ,. .. I'rocedurr for TrIlersanl ,.irgn Pic,
Fixed Point Alroithms., April 1981,
11. Saigal, "Computational Complyexy of a Pieceiwise Linear Homo-
topy Algorithm, Augunst 1981.


Volume 22 No. 3

JI.L. (offin," Convergence of a Cyclic Ellipsoid Algorithm for Sys-
tens of Linear Equalitis. "
Rt. Benveniste, d' .i.,...... Computlaional ,' A Stochastic
A. Dax, "Partial i '.. i' i.... for Symmetric (Gaussian Elini-
nation. "
R. Clandrasekaran and A. Tamir, i'. I ...i ..... Bounded Algo-
rithms for Iocating p-Centers on a Tree."
J.]. Jarvis and S. Tufekci, "Decomposition Algorithmns jor Locating
Minimal Cuts in a Network."
R. Lazimy, "Mixed Integr Quadratic .......
1). Granot. I (;ranot and \i. Vaessien. "An accelerated (overingl
Relaxation Algorithm for Solving 0-1 Positive ' I "

Volume 23 No. I

1). Goldfarb and M.J. Todd, "t i'., ,, and Implmentation of
thie /llipsoid Algorithm for Linear ; .....
I).P. O'Leary. "A discrete Newton Algorithm for f Minimizing a
Function of Many Variables."
Michael J. Todd. "An Implementation of Shi ,.,i Method for
Linear .. ........... Problems with Variable Upper Bounds. "
G. Cornucjols and J.-M. Thizy. "Sonme Facets of lthe Simple Plant
l.ocalion I'olytopo. "
Hiroshi Yamashita, "-, Globally Convergent ', .. Mllethod
with an Augmen ted Lagrangian Typet Penally Function. "
Dielmar Saupc, "On Accelerating PL Continuation Algorithms by
Predictor Corrector Methods. "''
M. Henig, "F'lxistence and Characterization of ..... Decisions
with Respect to Cones. "

'UML ~i

FI) 0 0

Network Mllodels and Associated Applications, edited by Darwin
! ......1... and Johlin MN lvey. Reprinted from Mathematical .........
Sludies, Vol. 15, 1981. 176 pp.. $25.00, North-Holland.
Dynamic Programming : Models and Applications, by Eric V.
Denardo, 1982, 240 pp., $20.95.. Prentici-lall.
Combinatorial Optimization : Algorithms and Complexity. )by
Christo I. apadimitrion and Kennetih h.i 1981. 480 pp., S23.95.

Soon to / ..,i .1'

Evaluating Ualthematical Progratmmin Techniques, edited by Joh
11. lMulvcy. -. -. of an NBS Conference. Boulder, Colorado, Jan-
uary. 1981. S20.00 (approx.), Springer-Verla!. ,Lecture Notes in Compiler

This public docun iii t wa.: promiilted a! i ('oi cos! of -,12>.15 uo
).01 per cop' to ilnfonr! m earache tlmaih recent research resultF.

F ~l

I, complete and return the enclosed questionnaire which was prepared by the
l'.t X utivie Committiee. ..Arthur M. Geoffrion (UC(.A\) becaine ',i .1 i of thi Institute of
Management science on September I, l "'.I. c .l. i, ,, 'i .... i ( atrloo) is sp ending
sevI'n monthly J aiilanar tlirotuh ij uly 1I82. in IN I A outside olf Paris. .TI Proct(eedin4s of
lih Inhltrnational Siymposium on Optimum Structural )Design, held in (Ool'Tr, I :'1, is
availall froiim t office of Special I ,..i ..... t i t'dux cation, I: university of \rizona, TIu' so .
.ThI'le _I., design n Automation Confcrmnce tU be held in Seltembc r, 19 12. invit- pa rs onl
optimizatioin techiqii us. Contact Prof. len E. Johnson (V ,'. h I.h nivrsity), 'iNashvillh.
('Ten. .Dr. Andrus Frank i sw.nding tiM 1I81 .' acadmeic yar at the University of rin.
.. .Julian Araoz Duiranid ( niversiad SiMon olivr, Caracas) is also visiting he O university of
ionn for n..1-82 e. K. :i.i, orm rlt otf the ynivrsity of Sltttgarri. as accaptld a
prol'fessorship at lthe Inslitute fi'ir \i i'rwandte Mathlcmatik. Technitsch Hochischul \Iiicheln .
.a. jane 3K. 261u (l 1) h Win icct d Vice. .. w. .. al larq of S1 \1 lhrom h l .
lran sm s [ni ter'silv Ihld a ulnposili) in January,. I in connection with tdh 251h Anni-
vrrsar\ of the Iconomiletric Institute' at lolterdami. M.J.D. I (Camllridge). David
(Gale (Berkel'y) and Henri 1..,1I (I I. .1l, were amoliong the invited 'peakers. .er J.-B.
Wels (Knlucky) is spdiing Js aary Mirough \ugust at 1AS. .()'TIMA \o. 5
imnc rrectly reported lthe amount of the ,I ... awards (o lbe prsilted at th \I Sympo-
hilii). The correct amount is $750 (minininum).
S. I. ... for the next issue of (L '! I \ is May 15, I 1

303 Weil Hall
.ilh',-, of Engineering
University of Florida E Det. WeiL al l
Gainesville, 0'lorida 32611 1 niv. o5 Florida
Gainlp.sville, Fla. 3261 1



1982 Questionnaire

The Society can serve you best if it knows what you want. Please complete this questionnaire,
fold so the address shows, tape it closed (no staples), and mail. Thank you!

1. Normally, the 1985 International Symposium on Mathematical Programming would be
held in North America. There has been some discussion of holding it in Japan, but
there is concern about the travel cost for many of our members. Would you plan to
attend the Symposium if it were held in --
Japan: ] Probably yes ] Probably no
North America: E] Probably yes ] Probably no

2. The activities of our Society are expanding and we would like to invite interested
members to become more active. Please check those areas in which you might like to
participate; if any, put your name and return address on the reverse.
R Publications Committee OE Membership Committee
E] Committee on Algorithms
[] Establish new activities(e.g., Video Tape Library)
E- Editorial activities (e.g., edit problem column for Optima)
E Administrative (e.g., advice on accounting, secretariet, etc.)
E] Other (please specify)

3. List subjects, if any, whose emphasis in the journal you would like changed.
Give more emphasis to:

Give less emphasis to:

4. If you have submitted an article to Mathematical Programming in the last two years, how
did you find the response time?
O Excellent R Good ] Fair ] Poor

5. Do you think the Society should sponsor a new journal devoted exclusively to applications
and systems? E] Yes El No
Assuming reasonable cost, would you subscribe to it? O] Yes E] No

6. What features would you like to see added to Optima?

List here any services or activities that the Society is not providing that you would like to
have, and any other comments.

Professor Donald W. Hearn
Editor, Optima
College of Engineering
University of Florida
Gainesville, Florida 32611
U. S. A.

University of Florida Home Page
© 2004 - 2010 University of Florida George A. Smathers Libraries.
All rights reserved.

Acceptable Use, Copyright, and Disclaimer Statement
Last updated October 10, 2010 - - mvs