Volume Information

Volume InformationSource: Operations Research, Vol. 25, No. 6 (Nov. - Dec., 1977), pp. 1045-1055Published by: INFORMSStable URL: http://www.jstor.org/stable/169867 .

Accessed: 09/05/2014 15:22

Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at .http://www.jstor.org/page/info/about/policies/terms.jsp

.JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range ofcontent in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new formsof scholarship. For more information about JSTOR, please contact [email protected].

.

INFORMS is collaborating with JSTOR to digitize, preserve and extend access to Operations Research.

http://www.jstor.org

This content downloaded from 195.78.109.56 on Fri, 9 May 2014 15:22:12 PMAll use subject to JSTOR Terms and Conditions

http://www.jstor.org/action/showPublisher?publisherCode=informs

http://www.jstor.org/stable/169867?origin=JSTOR-pdf

http://www.jstor.org/page/info/about/policies/terms.jsp


VOLUME 25-1977

Authors-Articles, Letters, and Technical Notes

A

ACKOFF, RUSSELL L., National Develop- ment Planning Revisited, 207-218

AGGARWAL, SUMER, see KHALIFA, HOT- TENSTEIN, AND AGGARWAL (technical note), 1032-1039

ALBRIGHT, S. CHRISTIAN, Structure of Optimal Policies in Complex Queuing Systems, 1020-1027

AVRIEL, MORDECAI AND VICTORIA GURO- VICH, A Condensation Algorithm for a Class of Algebraic Programs, 78-88

B

BARKER, WILLIAM H., II, Information Theory and the Optimal Detection Search, 304-314

BARNEA, AMIR, see LIEBER AND BARNEA,

696-705 BARR, D. R., AND M. U. THOMAS, An

Eigenvector Condition for Markov Chain Lumpability (technical note), 1028-1031

BELL, DAVID E., A Utility Function for Time Streams Having Inter-Period De- pendencies, 448-458

- - AND JEREMY F. SHAPIRO, A Con- vergent Duality Theory for Integer Programming, 419-434

BEN-TAL, A., see HUANG, ZIEMBA, AND

BEN-TAL, 315-325 BERGER, PAUL D., see GLICKMAN AND

BERGER (technical note), 163-167 BRACKEN, JEROME, JAMES E. FALK, A-ND

FREDERICK A. MIERCORT, A Strategic Weapons Exchange Allocation Model, 968-976

BRILL, P. H., AND M. J. M. POSNER, Level Crossings in Point Processes Applied to Queues: Single-Server Case, 662-674

BROWN, M., H. SOLOMON, AND M. A. STEPHENS, Estimation of Parameters of Zero-One Processes by Interval Sampling, 493-505

BUTLER, DAVID A., An Importance Rank- ing for System Components Based upon Cuts (technical note), 874-878

- The Use of Decomposition in the Optimal Design of Reliable Systems, 459-468

C

CHANDRASEKARAN, R., AND S. SUBBA RAO, A Special Case of the Transporta- tion Problem (technical note), 525-528

CHANDRASEKHAR, DAS, The (S-1, S) Inventory Model under Time Limit on Backorders, 835-850

CHARNES, A., Letter to the Editor, 178 AND DANIEL GRANOT, Coalitional

and Chance-Constrained Solutions to n-Person Games, II: Two-Stage Solu- tions, 1013-1019

----, , AND FRIEDA GRANOT, On Intersection Cuts in Interval Integer Linear Programming (technical note), 352-355

, FRIEDA GRANOT, AND F. PHIL- LIPS, An Algorithm for Solving Interval Linear Programming Problems, 688-695

CHARNETSKI, JOHNNIE R., Bayesian De- cision Making with Ordinal Informa- tion (technical note), 889-892

CHRISTOFIDES, NiCOS AND CHARLES WHITLOCK, An Algorithm for Two- Dimensional Cutting Problems, 30-44

COVER, THOMAS M. AND CARROLL W. KEILERS, An Offensive Earned-Run Average for Baseball, 729-740

CRABILL, THOMAS B., DONALD GROSS, AND MICHAEL J. MAGAZINE, A Classi- fied Bibliography of Research on Opti- mal Design and Control of Queues, 219-232

D

DEGROOT, MORRIS H., see ROTH, KA- DANE, AND DEGROOT, 901-919

DESHMUKH, S. D., AND SURESH JAIN,

1045



1046 Index to Volume 25

Capacity Design and Service Quality Control in a Queuing System, 651-661

DINKEL, JOHN J., AND GARY A. KOCHEN- BERGER, On Sensitivity Analysis in Geometric Programming (technical note), 155-172

DUTTA, BIPLAB K., see MAY AND DUTTA

(letter), 893-894

E

ELTON, EDWIN J., MARTIN J. GRUBER, AND MANFRED W. PADBERG, Simple Criteria for Optimal Portfolio Selection with Upper Bounds, 952-967

ERLENKOTTER, DONALD, AND J. SCOTT

ROGERS, Sequencing Competitive Ex- pansion Projects, 937-951

ETCHEBERRY, JAVIER, The Set-Covering Problem: A New Implicit Enumeration Algorithm, 760-772

F

FALK, JAMES E., see BRACKEN, FALK,

AND MIERCORT, 968-976 FISCHER, M. J., Analysis and Design of

Loop Service Systems via a Diffusion Approximation, 269-278

FISHBURN, PETER C., Multicriteria Choice Functions Based on Binary Relations, 989-1012

FRIEDMAN, YORAM, Optimal Strategy for the One-against-Many Battle (technical note), 884-888

FRIES, BRANT, Errata, 1040

G

GARFINKEL, ROBERT S., Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems, 741-751

GASS, SAUL I., Preface, 185 GLICKMAN, THEODORE S., AND PAUL D.

BERGER, Cost/Completion-Date Trade- offs in the Transportation Problem (technical note), 163-167

GOHEEN, LOLA COLEMAN, On the Optimal Operating Policy for the Machine Re- pair Problem When Failure and Re- pair Times Have Erlang Distribution, 484-492

GRANOT, DANIEL, see CHARNES AND

GRANOT, 1013-1019

- see CHARNES, GRANOT, AND

GRANOT (technical note), 352-355 GRANOT, FRIEDA, see CHARNES, GRANOT,

AND GRANOT (technical note), 352-355 , see CHARNES, GRANOT, AND

PHILLIPS, 688-695 GREENBERG, HARVEY J., The One-Di-

mensional Generalized Lagrange Mul- tiplier Problem (technical note), 338- 345

GROSS, DONALD, see CRABILL, GROSS, AND MAGAZINE, 219-232

GRUBER, MARTIN J., see ELTON, GRUBER, AND PADBERG, 952-967

GUROVICH, VICTORIA, see MORDECAI AND

GUROVICH, 78-88

H

HANSOTIA, BEHRAM, Some Special Cases of Stochastic Programs with Recourse (technical note), 362-363

HAUSER, JOHN R., AND GLEN L. URBAN,

A Normative Methodology for Modeling Consumer Response to Innovation, 579- 619

HAZEWINKEL, MICHIEL, Some Examples Concerning Linear Continuity of Solu- tions to Programming Problems (technical note), 715-719

HENDRICK, THOMAS E., see PLANE AND

HENDRICK, 563-578 HONG, SAMAN, AND MANFRED W. PAD-

BERG, A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges (technical note), 871- 873

HOTTENSTEIN, MICHAEL, see KHALIFA, HOTTENSTEIN, AND AGGARWAL (tech-

nical note), 1032-1039 HOUCK, DAVID J., AND R. RAO VEMU-

GANTI, An Algorithm for the Vertex Packing Problem, 773-787

Hu, T. C., see TIEN AND Hu, 404-418 HUANG, C. C., I. VERTINSKY, AND W. T.

ZIEMBA, Sharp Bounds on the Value of Perfect Information, 128-139

-W. T. ZIEMBA, AND A. BEN-TAL, Bounds on the Expection of a Convex Function of a Random Variable: With Applications to Stochastic Program- ming, 315-325



Authors-Articles, Letters, and Technical Notes 1047

I

INGARGIOLA, GIORGIO P., AND JAMES F. KORSH, A General Algorithm for One- Dimensional Knapsack Problems, 752- 759

ISKANDER, WAFIK, see PANWALKAR AND ISKANDER, 45-61

J JAGANNATHAN, R., Errata (letter), 896

Minimax Procedure for a Class of Linear Programs under Uncertainty (technical note), 173-177

JAIN, SURESH, see DESHMUKH AND JAIN, 651-661

K

KADANE, JOSEPH B., See ROTH, KADANE, AND DEGROOT, 901-919

KAHANE, YEHUDA, Insurance Exposure and Investment Risks: A Comment on the Use of Chance-Constrained Program- ming (technical note), 330-337

KALLIO, MARKKU, AND EVAN L. POR- TEUS, Triangular Factorization and Generalized Upper Bounding Tech- niques, 89-99

KAN, Y. C., Optimal Search of a Moving Target, 864-870

KEILERS, CARROLL W., see COVER AND KEILERS, 729-740

KENDALL, KENNETH E., AND STANLEY ZIONTS, Solving Integer Programming Problems by Aggregating Constraints (technical note), 346-351

KHALIFA, DAVID, MICHAEL HOTTEN- STEIN, AND SUMER AGGARWAL, Can- nibalization Policies for Multistate Systems (technical note), 1032-1039

KOCHENBERGER, GARY A., see DINKEL AND KOCHENBERGER (technical note), 155-162

KOENIG, SHERRI A., see MUCKSTADT AND KOENIG, 387-403

KOENIGSBERG, ERNEST, To the Editor (letter), 895

KOOPMAN, BERNARD O., Intuition in Mathematical Operations Research, 189- 206

KORSH, JAMES F., see INGARGIOLA AND KORSH, 752-759

KOTIAH, T. C. T., On a Linear Program- ming Technique for the Steady-State Behavior of Some Queuing Systems, 289-303

L

LAW, AVERILL M., Conservation Equa- tions and Their Application to Queuing Simulations, 279-288

LIBERATORE, MATTHEW J., Planning Horizons for a Stochastic Lead-Time Inventory Model, 977-988

LIEBER, ZVI, AND AMIR BARNEA, Dy- namic Optimal Pricing to Deter Entry under Constrained Supply, 696-705

LIPPMAN, STEVEN A., AND SHALER

STIDHAM, JR., Individual versus Social Optimization in Exponential Conges- tion Systems, 233-247

M

MACHOL, ROBERT E., AND MICHAEL

WIEN, Errata, 364 MAGAZINE, MICHAEL J., see CRABILL,

GROSS, AND MAGAZINE, 219-232 MAY, JERROLD H., AND BIPLAB K.

DUTTA, On Solving Cesario's Interesting Test Problem (letter), 893-894

MIERCORT, FREDERIC A., see BRACKEN,

FALK, AND MIERCORT, 968-976 MINIEEA, EDWARD, The Centers and

Medians of a Graph, 641-650 MOND, P., On Converse Duality for a

Nondifferential Programming Problem (technical note), 713-714

MORSE, PHILIP M., ORSA Twenty-five Years Later, 186-188

MUCKSTADT, JOHN A., AND SHERRI A. KOENIG, An Application of Lagrangian Relaxation to Scheduling in Power- Generating Systems, 387-403

N

NAHMIAS, STEVEN, Comparison between Two Dynamic Perishable Inventory Models (technical note), 168-172

, Higher-Order Approximations for the Perishable-Inventory Problem, 630- 640

NARULA, SUBBASH, UGENNAYA I. OGBU,

AND HAAKON M. SAMUELSSON, An




Algorithm for the p-Median Problem (technical note), 709-712

0

OGBU, UGENNAYA I., see SUBBASH, OGBU, AND SAMUELSSON (technical note), 709-712

O'NEILL, RICHARD P., Column Dropping in the Dantzig-Wolfe Convex Program- ming Algorithm: Computational Ex- perience (technical note), 148-154

P

PADBERG, MANFRED W., see ELTON,

GRUBER, AND PADBERG, 952-967 , see HONG AND PADBERG (technical

note), 871-873 PANWALKAR, S. S., AND WAFIK

ISKANDER, A Survey of Scheduling Rules, 45-61

PARKER, RODGER, Minimizing Cost to Maintain a Steady-State Growth Rate in a Population (technical note), 326-329

PHILLIPS, F., see CHARNES, GRANOT, AND PHILLIPS, 688-695

PLANE, DONALD R., AND THOMAS E. HE'NDRICK, Mathematical Programming and the Location of Fire Companies for the Denver Fire Department, 563-578

PLATZMAN, LOREN, Improved Conditions for Convergence in Undiscounted Markov Renewal Programming (technical note), 529-532

PLISKA, STABLDY R., see TCHA AND PLISKA, 248-258

PORTEUS, EVAN L., On Optimal Dividend, Reinvestment, and Liquidation Policies for the Firm, 818-834

, see KALLIO AND PORTEUS, 89-99 POSNER, M. J. M., see BRILL AND POSNER,

662-674

R

RAO, S. SUBBA, see CHANDRASEKARAN AND RAO (technical note), 525-528

RAU, JOHN G., Errata, 537 ROBILLARD, PIERRE, AND MICHEL TRA-

HAN, The Completion Time of PERT Networks, 15-29

ROBINSON, STEPHEN M., A Characteriza-

tion of Stability in Linear Program- ming, 435-447

ROGERS, J. SCOTT, see ERLENKOTTER AND ROGERS, 937-951

ROTH, ARTHUR, JOSEPH B. KADANE, AND MORRIS H. DEGROOT, Optimal Peremptory Challenges in Trials by Juries: A Bilateral Sequential Process, 901-919

ROTHKOPF, MICHAEL H., Bidding in Simultaneous Auctions with a Con- straint on Exposure, 620-629

RUBINSTEIN Y., Using a Monte Carlo Method for Optimizing Smoothed Func- tionals (technical note), 720-724

RUSSELL, ROBERT A., An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions (technical note), 517-524

S

SAHNI, SARTAJ, General Techniques for Combinatorial Approximation, 920-936

SAMUELSSON, HAAKON M., see SABBASH,

OGBU, AND SAMUELSSON (technical

note), 709-712 SCHROETER, GERHARD, The Application

of a Hankel Transformation to a Class of Circularly Symmetric Coverage Problems, 675-687

SCHWARZ, LEROY B., A Note on the Near Optimality of "5-EOQ's Worth" Fore- cast Horizons (technical note), 533-536

SEGAL, M., AND D. B. WEINBERGER,

Turfing, 367-386 SETH, KIRAN, Optimal Service Policies,

Just after Idle Periods, in Two-Server Heterogeneous Queuing Systems (technical note), 356-361

SHAFTEL, TIMOTHY L., AND GERALD L. THOMPSON, A Simplex-Like Algorithm for the Continuous Modular Design Problem, 788-807

SHANE, HAROLD D., Mathematical Models for Economic and Political Advertising Campaigns, 1-14

SHAPIRO, JEREMY F., see BELL AND

SHAPIRO, 419-434 SHAW, LEONARD, Errata, 538 SIDNEY, JEFFREY B., Optimal Single-

Machine Scheduling with Earliness and Tardiness Penalties, 62-69



Authors-Articles, Letters, and Technical Notes 1049

SMEERS, YvEs, An Algoritem for Some Special Nondifferentiable Optimization Problems, 808-817

SOLOMON, H., see BROWN, SOLOMON, AND STEPHENS, 493-505

STEPHENS, M. A., see BROWN, SOLOMON, AND STEPHENS, 493-505

STIDHAM, SHALER, JR., Cost Models for Stochastic Clearing Systems, 100-127

- see LIPPMAN AND STIDHAM, 233- 247

STOYAN, DIETRICH, Bounds and Ap- proximations in Queuing through Monotonicity and Continuity, 851-863

SZWARC, WLODZIMIERZ, Optimal Two- Machine Orderings in the 3 X n Flow- Shop Problem, 70-77

T

TAUBE-NETTO, MIGUEL, Two Queues in Tandem Attended by a Single Server, 140-147

TAYLOR, JAMES G., Determining the Class of Payoffs That Yield Force- Level-Independent Optimal Fire-Sup- port Strategies, 506-516

TCHA, DONG-WAN, AND STANLEY R. PLISKA, Optimal Control of Single- Server Queuing Networks and Multi- Class M/G/1 Queues with Feedback, 248-258

THOMAS, M. U., see BARR AND THOMAS

(technical note), 1028-1031 THOMPSON, GERALD L., see SHAFTEL

AND THOMPSON, 788-807 TIEN, B. N., AND T. C. Hu, Error Bounds

and the Applicability of the Greedy Solution to the Coin-Changing Problem, 404418

TRAHAN, MICHEL, see ROBILLARD AND

TRAHAN, 15-29 TURNBULL, BRUCE W., A Note on the Non-

parametric Analysis of the Stollmack-

Harris Recidivism Data (technical note), 706-708

U

URBAN, GLEN L., see HAUSER AND URBAN, 579-619

V

VASICEK, OLDRICH A., An Inequality for the Variance of Waiting Time under a General Queuing Discipline (technical note), 879-883

VEMUGANTI, R. RAO, see HOUCK AND VEMUGANTI, 773-787

VERTINSKY, I., see HUANG, VERTINSKY, AND ZIEMBA, 128-139

w

WEINBERGER, D. B., see SEGAL AND WEINBERGER, 367-386

WHITLOCK, CHARLES, see CHRISTOFIDES AND WHITLOCK, 30-44

WIEN, MICHAEL, see MACHOL AND WIEN, Errata, 364

WINSTON, WAYNE L., Assignment of Customers to Servers in a Heteroge- neous Queuing System with Switching, 469-483

, Optimal Control of Discrete and Continuous Time Maintenance Systems with Variable Service Rates, 259-268

z

ZADEH, NORMAN, Computation of Optimal Poker Strategies, 541-562

ZIEMBA, W. T., Errata, 1040 - see HUANG, ZIEMBA, AND BEN- TAL, 315-325

, see HUANG, VERTINSKY, AND ZIEMBA, 128-139

ZIONTS, STANLEY, see KENDALL AND

ZIONTS (technical note), 346-351



Subject Index-Articles, Letters, Technical Notes

A

Advertising campaigns, economic, political, 1-14

Algorithms Branch-and-bound, using lagrangian

method, 387-403, 709-713, 968-976 Condensation, class of algebraic pro-

grams, 78-88 Continuous modular design problem,

788-807 Cutting plane, 352-355 Dantzig-Wolfe convex programming,

148-155 General interval reduction, 338-345 George Kimball Medal citations, 1041-

1042 Greedy, coin-changing problem, 404-

418 Heuristic, 367-386 Heuristic, traveling salesman problem,

517-524 Implicit enumeration, set covering,

760-772 Interval linear programming, 688-695 Knapsack problems, one-dimensional,

752-759 Monomial condensations, cutting

planes, 78-88 Nonlinear optimization problems, 808-

817 p-Median problem, 709-713 Parametric statistical gradient, 720-

724 Polynomial time approximation, 920-

936 Selection of jurors, 901-919 Single-machine scheduling, penalties,

62-69 Transportation problem, 525-528 Tree-search, cutting problems, 30-44 Two-dimensional cutting problems, 30-

44 Vertex packing problem, 773-787

Allocating advertising expenses, 1-14 Alternating renewal process, 493-505 Announcements, i, 897, 1056 Appreciation to Referees, 179-182 Assessment utility functions, 448-458

B

Baseball, offensive earned-run average, 729-740

Battle tactics, 879-884 Bayesian decision making, ordinal in-

formation, 889-892 Bibliography, design, control, queues,

219-232 Bidding, simultaneous auctions, 620-629 Binary relations, multicriteria choice

functions, 989-1012 Bounded variables, integer programming

problems, 346-351 Bounds, approximations, queuing, 850-

863

C

Campaigns, economic, political, 1-14 Cannibalization policies, multistate sys-

tems, 1032-1039 Capacity design, service control, queues,

651-661 Cesario's test problem solution, 893-894 Chance-constrained games, 1013-1019 Circularly symmetric coverage problems,

Hankel transforms, 675-687 Coin-changing problem, 404-418 Combinatorial approximation tech-

niques, 920-936 Committees, 1976-1977, iv, 1977-1978,

iii-iv Competitive expansion projects, se-

quencing, 937-951 Completion time, PERT networks, 15-29 Congestion systems, individual versus

social optimization, 233-247 Conservation equations, application

queuing simulations, 279-288 Constant-correlation coefficient, port-

folio selection, 955-967 Continuous modular design problem,

788-807 Control, maintenance systems, 259-268 Control, queuing networks, 248-258 Converse duality, nondifferentiable pro-

gramming problem, 713-714 Convex-concave profit functions, 620-629 Convex programming algorithm, 148-154

1050



Subject Index-Articles, Letters, Technical Notes 1051

Cost/Completion-date tradeoffs, transportation problem, 163-168

Cost models, stochastic clearing system, 100-127

Council of the Society, Past Presidents, Members, Editors, ORSA Publica- tions, iii

Customer impatience, inventory model, 835-850

Customers, servers, 469-483 Cyclic queue problem, 895

D

Deadline problem, job sequencing, 920- 936

Decomposition, optimal design, reliable systems, 459-468

Defense analyses, artillery, air-to-sur- face, anti-aircraft weapons, 675-687

Denver, location of fire companies, 563- 578

Design, systems, reliable, 458-468 Development, distribution, wealth, op-

portunity, 207-218 Development, less-than-well-developed

countries, 207-218 Diffusion approximation, loop service

systems, 269-278 Dividend, reinvestment, liquidation

policies, 819-834 Dual linear programming, 435-447 Dual problems, integer programming,

419-434 Dynamic optimal pricing, 696-705

E

Economic criteria, determining project timing decisions, 937-951

Economic, political campaigns, 1-14 Editorial policy, i Electric power system planning, 937-951 Error bounds, applicability greedy solu-

tion, coin-changing problem, 404-418 Estimation, parameters, zero-one proc-

esses, 493-505 Estimators, queuing systems, 279-288 Expectation, random convex function,

315-325 Evans modular design problem, 788-807

F

Facility-location problems, 641-650

Finite Markov chain, stationary discrete parameter, 1028-1031

Fire companies, optimal location, 563-578 Five-year development plan, India, 207-

218 Flow-shop problems, three-machine,

70-77 Forecast horizons, 533-536 Fossil-Fuel power-generating system,

387-403

G

Generalized upper bounding, triangular factorization, 89-99

Graph, centers, medians, 641-650

H

Hankel transforms, circularly symmetric coverage problems, 675-687

Harvard Community Health Plan (HCHP), 614-619

I

Idealized system design, 214-218 Implicit enumeration algorithm, set

covering, 760-772 Importance ranking, system com-

ponents, 874-879 India, five-year development plan, 207-

218 Individual versus social optimization,

congestion systems, 233-247 Information, search theory, 304-314 Innovation, modeling consumer re-

sponse, 579-619 Instructions for contributors, i-ii Insurance exposure, investment risks,

chance-constrained programming, 330-337

Integer programming, dual problems, 419-434

Integer programming problems, bounded variables, 346-351

Interactive computer program, turfing, 377-386

Intersection cut, solving interval linear programming problems, 352-355

Interval linear programming, 688-695 Interval sampling, zero-one processes,

493-505 Intuition, mathematical operations re-

search, 189-206




Inventory model, time limit, backorders, 835-850

J Job sequencing, deadline problem, 920-

936 Jury trials, peremptory challenges,

901-919

K

Kawara's fire-support differential game, 506-516

L

Lagrange multiplier, one-dimensional, 338-345

Lanchester Prize, 1976 call for nomina- tions, 365-366

Lin, Kernighan heuristic, 517-523 Linear continuity, solutions, program-

ming problems, 715-719 Linear programming, steady-state, some

queuing systems, 289-303 Location, fire companies, 563-578 Loop service systems, 269-278

M

Machine repair problem, 484-492 Maintaining national growth rate, 326-

329 Maintenance systems, control, 259-268 Markov decision problems, 529-533 Mathematical operations research, in-

tuition, 189-206 Mathematical programming problems,

419-434 Mexico, CONASUPO, 207-218 Military problems

Combat strategies, 506-516, 675-687 Fire-support differential game, 506-

516 ICBM, SLBM, bombers, three weapon

types, each side, 968-976 Moving target, optimal search, 864-870 Optimal strategy, one-against-many

battle, 884-888 Strategic weapons exchange allocation

model, 968-976 Time-sequential fire-support strate-

gies, 506-516 Minimizing wallpaper waste, 741-751

M.I.T. new health-care plan (HMO), 590-619

Modeling consumer response, innovation, 579-619

Models Advertising campaign, two-competi-

tor, 1-14 Chance-constrained programming, 330-

337 Constant correlation, portfolio selec-

tion procedures, 952-967 Consumer response, 579-619 Customer, server queue, 469-483 Decision making, Bayesian, 889-892 Denver, Colorado, optimization fire

station location study, 563-578 Dynamic control, 219-232 Dynamic perishable inventory, 168-172 General differential game problem,

696-705 Generalized clearing system, 100-127 Integer programming, 387-403 Inventory, time limit, backorders,

834-850 Jury selection process, 901-919 Markov chain, 1028-1031 Mathematical, 186-188, 662-674 Miscellaneous, 219-232 Moving target, 864-870 Multilocation capacity planning, 937-

951 Optimal dynamic dividend, reinvest-

ment, liquidation policies, established firm, 819-834

Optimum portfolios, single index, 952- 967

Perishable-inventory problem, 630- 640

Planning, differentiated types capacity, 937-951

Project sequencing, 937-951 Queue discipline control, 219-232 Single-server queue, 662-674 Static design 219-232 Stochastic programming, 173-177, 367-

386, 977-988 Strategic weapons exchange alloca-

tion, 968-976 Two-competitor advertising campaign,

1-14 Monotonicity, continuity, queuing sys-

tems, 850-863




Monte Carlo method, optimizing smoothed functionals, 720-724

M-tour traveling salesman problem, 517-524

Multicriteria choice functions, 989-1012 Multiple traveling salesman problem,

fixed charges, 871-874

N

National development planning, 207-218 Near optimality, "5-EOQ's worth"

forecast horizon, 533-536 New products, services, consumer re-

sponse, 579-619 Nondifferentiable optimization prob-

lems, algorithm, 808-817 Nonparametric analysis, Stollmack-

Harris recidivism data, 706-707 n-Person cooperative games, 1013-1019

0

Offensive earned-run average, baseball (OERA), 729-740

One-against-many battle, optimal strategy, 879-884

One-dimensional knapsack problems, algorithm, 752-759

Operations research concepts, 189-206 Optimal design, loop service systems,

273-278 Optimal dividend policies, established

firm, 819-834 Optimal finite horizon policy, 533-536 Optimal fire-support strategies, 506-516 Optimal poker strategies, 541-562 Optimal policies, queuing systems, 1020-

1027 Optimal portfolio selection, 952-967 Optimal pricing strategy, 696-705 Optimal procedure, jury selection, 901-

919 Optimal search, information, 304-314 Optimal search, moving target, 864-870 Optimal service policies, 356-360 Optimization problems involving in-

sufficient a priori information, 720- 724

Optimization, queuing system, design, control, 651-661

ORSA twenty-five years later, 186-188

p

Pan American Health Organization, determining effort required, mini- mum cost holding specified steady- state growth rate, 326-329

Peremptory challenges, jury trials, 901- 919

Perfect information value, 128-139 Perishable-inventory problem, 630-640 PERT-CPM projects, 62-69 PERT decision networks, 15-29 PERT networks, completion time, 15-29 Planning horizons, 977-988 Poisson arrival process, 140-147 Poisson-distributed customer arrivals,

optimal service policies, 356-360 Poker, optimal strategies, 541-562 Political, economic campaigns, 1-14 Population growth maintenance, 326-

329 Portfolio selection, upper bounds, 952-

967 Power generation, scheduling, 387-403 Preface, 185 PREFMAP, determine preference judg-

ments, 581-619 Programming

Chance-constrained, 330-337 Convex problem, 896 Dynamic, 30-44, 630-640, 977-988 Geometric, sensitivity analysis, 155-

163 Integer, 346-351, 352-355, 419-434, 773-

787 Linear, 173-177, 289-303, 688-695 Linear, block triangular, sparse con-

straint matrices, 89-99 Mathematical, 563-578, 713-715 Nonlinear, random variables, 128-139,

484-492, 715-719 Signomial extension, 78-88 Stochastic problems, 128-139, 173-177,

315-325, 361-363 Project timing decisions, determining,

937-951

Q Quadratic programming, activities non-

life-insurance company, 330-337




Queuing Bibliography, design, control, 219-232 Bounds and approximations, 851-863 Capacity design, service control, 651-

661 Cyclic problem, 895 General discipline, inequality, vari-

ance, waiting time, 879-884 Multi-class M/G/1, feedback, 248-258 Networks, control, 248-258 Optimal policies, 1020-1027 Optimum design, control, 651-661 Point processes application, 662-674 Policies, control problems, 469-483 Simulations, 279-288 Single-server networks, 248-258, 662-

674 System design, control problem, 651-

661 Two queues, single server, 140-147 Two-server, heterogeneous system,

356-360 R

Random convex function, expectation, 315-325

Random variable, convex function, 315- 325

Raw material market characteristics, 696-705

Reduction, branch-search algorithm, 752-759

Reliable systems design, 459-468 Repair problem, machine, 484-492

S

(S-1, S) inventory model, 835-850 Scheduling power generation, 387-403 Scheduling rules, 47-61 Scheduling rules survey, 45-61 Science, operations research, 189-206 Search theory, information,304-314 Selection, prospective jurors, 901-919 Sensitivity analysis, geometric program-

ming, 155-163 Sequencing competitive expansion pro-

jects, 937-951 Sequencing, scheduling, dispatching

rules, 45-61 Service process, 470-483 Service time distribution, queuing, 879-

884 Set covering, implicit enumeration al-

gorithm, 760-772

Signomial extension programming, 78-88 Simultaneous auctions, bidding, 620-629 Single-machine scheduling, penalties,

62-69 Single server, loop service systems, 269-

278 Single-server repair facility, 259-268 Single server, two queues, tandem, 140-

141 Socially optimal policies, 233-247 Solution, Cesario's test problem, 893-894 Solution, integer programming prob-

lems, bounded variables, 346-351 Solving problems, linear programming,

289-303 Spare parts, cannibalization policies,

1032-1039 Special purpose algorithm, 688-695 Stability, linear programming, 435-447 Stationary discrete parameter finite

Markov chain, 1028-1031 Stationary single-server queues, Poisson

arrivals, 662-674 Stochastic clearing system, cost models,

100-127 Stochastic lead-time inventory model,

977-988 Stochastic programs, recourse, 361-363 Stollmack-Harris, nonparametric analy-

sis, recidivism data, 706-707 Strategic weapons exchange allocation

model, 968-976 System components, importance rank-

ing, 874-879

T

Tangential approximation, relative ef- fectiveness, 338-345

Telephone repair persons/installers, 367- 386

Temporal dependencies, utility functions, 448-458

Three-machine flow-shop problems, 70-77 Transportation problem, cost/comple-

tion-date tradeoffs, 163-168 Transportation problem, special case,

525-528 Traveling salesman problem, multiple,

fixed charges, 871-874 Triangular factorization, generalized

upper bounding techniques, 89-99 Turfing, 367-386




Tutorial, survey papers, 219-232 Two-dimensional cutting problems, 30-44 Two dynamic perishable inventory

models, 168-172 Two queues, tandem, attended by single

server, 140-147 Two-stage solution concepts, chance-

constrained games, 1013-1019 Two-strike nuclear warfare, 968-976

U

UNIVAC 1108, FORTRAN code, programming, 148-155

University of Texas, CCS, 178 Utility functions, temporal depend-

encies, 448-458

v

Value, perfect information, 128-139 Variations, queue disciplines, 850-863 Vehicle-type-dispatched problems, 517-

523 Vertex packing algorithm, 773-787 Von Neumann Theory Prize citation,

1043

w

Wallpaper waste, minimizing, 741-751 Waiting time variance, general queuing

discipline, 879-884 Work slices, redesigning, 367-386 Workload turfs, 367-386



Date post:	06-Jan-2017
Category:	Documents
Upload:	donhan
View:	215 times
Download:	3 times

Volume Information

Documents