Publications
84 results found
ANDERSON EJ, ARAMENDIA M, 1993, CONTINUOUS LINEAR COMPLEMENTARITY-PROBLEM, JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, Vol: 77, Pages: 233-256, ISSN: 0022-3239
ANDERSON EJ, PHILPOTT AB, 1992, EXTREME-POINTS FOR LINEAR OPTIMAL-CONTROL PROBLEMS WITH DIAGONAL STRUCTURE, SIAM JOURNAL ON CONTROL AND OPTIMIZATION, Vol: 30, Pages: 1385-1394, ISSN: 0363-0129
ANDERSON EJ, ARAMENDIA M, 1992, A LINEAR-PROGRAMMING APPROACH TO THE SEARCH GAME ON A NETWORK WITH MOBILE HIDER, SIAM JOURNAL ON CONTROL AND OPTIMIZATION, Vol: 30, Pages: 675-694, ISSN: 0363-0129
- Author Web Link
- Cite
- Citations: 2
MASON AJ, ANDERSON EJ, 1991, MINIMIZING FLOW TIME ON A SINGLE-MACHINE WITH JOB CLASSES AND SETUP TIMES, NAVAL RESEARCH LOGISTICS, Vol: 38, Pages: 333-350, ISSN: 0894-069X
- Author Web Link
- Cite
- Citations: 60
Anderson EJ, 1991, The continuous complementarity problem, Optimization, Vol: 22, Pages: 419-426, ISSN: 0233-1934
- Cite
- Citations: 5
ANDERSON EJ, ARAMENDIA MA, 1990, THE SEARCH GAME ON A NETWORK WITH IMMOBILE HIDER, NETWORKS, Vol: 20, Pages: 817-844, ISSN: 0028-3045
- Author Web Link
- Cite
- Citations: 14
ANDERSON EJ, NYIRENDA JC, 1990, 2 NEW RULES TO MINIMIZE TARDINESS IN A JOB SHOP, INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, Vol: 28, Pages: 2277-2292, ISSN: 0020-7543
- Author Web Link
- Cite
- Citations: 90
Gal S, Anderson EJ, 1990, Search in a maze, Probability in the Engineering and Informational Sciences, Vol: 4, Pages: 311-318, ISSN: 0269-9648
Suppose that you find yourself trapped in a maze about which you know nothing except that it has an exit point. We present an optimal strategy that will lead you to the exit point in minimum expected time. This strategy ensures that the expected total length of the arcs you traverse will not exceed the sum of the lengths of the arcs in the maze. © 1990, Cambridge University Press. All rights reserved.
ANDERSON EJ, 1990, TESTING FEASIBILITY IN A LOT SCHEDULING PROBLEM, OPERATIONS RESEARCH, Vol: 38, Pages: 1079-1088, ISSN: 0030-364X
- Author Web Link
- Cite
- Citations: 7
ANDERSON EJ, LEWIS AS, 1989, AN EXTENSION OF THE SIMPLEX ALGORITHM FOR SEMI-INFINITE LINEAR-PROGRAMMING, MATHEMATICAL PROGRAMMING, Vol: 44, Pages: 247-269, ISSN: 0025-5610
- Author Web Link
- Cite
- Citations: 27
ANDERSON EJ, LAGODIMOS AG, 1989, SERVICE LEVELS IN SINGLE-STAGE MRP SYSTEMS WITH DEMAND UNCERTAINTY, ENGINEERING COSTS AND PRODUCTION ECONOMICS, Vol: 17, Pages: 125-133, ISSN: 0167-188X
- Author Web Link
- Cite
- Citations: 6
ANDERSON EJ, PHILPOTT AB, 1989, A CONTINUOUS-TIME NETWORK SIMPLEX ALGORITHM, NETWORKS, Vol: 19, Pages: 395-425, ISSN: 0028-3045
- Author Web Link
- Cite
- Citations: 38
Anderson EJ, Lewis AS, Wu SY, 1989, The capacity problem, Optimization, Vol: 20, Pages: 725-742, ISSN: 0233-1934
We consider a type of infinite-dimensional linear program posed over a measure space and called a capacity problem. This problem is related to that of finding the electrostatic capacity of a conducting body, and arises in certain types of two-person zero-sum games. The duality theory for this problem is discussed, and conditions are given under which the optimal solution is a measure with finite support, When solutions are restricted to be measures with, finite support, a characterization of the extreme points of the feasible region is possible. This has implications for algorithms to solve the capacity problem. © 1989, Taylor & Francis Group, LLC. All rights reserved.
Anderson EJ, Philpott AB, 1986, CONTINUOUS NETWORK PROGRAMMING., Cambridge University, Engineering Department, (Technical Report) CUED/F-CAMS, ISSN: 0309-765X
Given a network having costs and upper bound constraints on the flows in its arcs, the minimum-cost network flow problem is that of finding flows which satisfy a flow-conservation constraint at each node and minimize the total cost of the flow. If the arc capacities vary as functions of time, and storage is permitted at the nodes of the network, then the problem becomes an infinite-dimensional linear program with a network structure. We describe an algorithm to solve such problems. This algorithm is a continuous-time version of the network simplex algorithm.
Anderson EJ, Philpott AB, 1984, DUALITY AND AN ALGORITHM FOR A CLASS OF CONTINUOUS TRANSPORTATION PROBLEMS., Mathematics of Operations Research, Vol: 9, Pages: 222-231, ISSN: 0364-765X
The authors treat the problem of transferring mass at least cost from one line segment to another, when there is a continuous cost function c(x, y) giving the cost of transferring material from the point x on the first line segment to the point y on the second. The mass has to be arranged with uniform density on the second line segment after the transfer. This is a one-dimensional form of the well-known mass-transfer problem. It is an infinite-dimensional linear program. A discussion is presented of the duality theory for this problem and the authors give an algorithm which converges to an optimal solution.
ANDERSON EJ, 1984, A CORRECTED PROOF OF A RESULT OF GRINOLD, JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, Vol: 99, Pages: 123-126, ISSN: 0022-247X
ANDERSON EJ, PHILPOTT AB, 1984, DUALITY AND AN ALGORITHM FOR A CLASS OF CONTINUOUS TRANSPORTATION PROBLEMS, MATHEMATICS OF OPERATIONS RESEARCH, Vol: 9, Pages: 222-231, ISSN: 0364-765X
- Author Web Link
- Cite
- Citations: 13
ANDERSON EJ, NASH P, PEROLD AF, 1983, SOME PROPERTIES OF A CLASS OF CONTINUOUS LINEAR-PROGRAMS, SIAM JOURNAL ON CONTROL AND OPTIMIZATION, Vol: 21, Pages: 758-765, ISSN: 0363-0129
- Author Web Link
- Cite
- Citations: 42
ANDERSON EJ, 1983, A REVIEW OF DUALITY-THEORY FOR LINEAR-PROGRAMMING OVER TOPOLOGICAL VECTOR-SPACES, JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, Vol: 97, Pages: 380-392, ISSN: 0022-247X
- Author Web Link
- Cite
- Citations: 15
Anderson EJ, Nash P, Weber RR, 1982, COUNTEREXAMPLE TO A CONJECTURE ON OPTIMAL LIST ORDERING., Journal of Applied Probability, Vol: 19, Pages: 730-732, ISSN: 0021-9002
A number of items are arranged in a line. At each unit of time one of the items is requested, the ith being requested with probability P//i. Rules are considered which reorder the items between successive requests in a fashion which depends only on the position in which the most recently requested item was found. It has been conjectured that the rule which always moves the requested item one closer to the front of the line minimizes the average position of the requested item. An example with six items shows that the conjecture is false. These results apply to modeling the storage of computer files.
ANDERSON EJ, NASH P, PHILPOTT AB, 1982, A CLASS OF CONTINUOUS NETWORK FLOW PROBLEMS, MATHEMATICS OF OPERATIONS RESEARCH, Vol: 7, Pages: 501-514, ISSN: 0364-765X
- Author Web Link
- Cite
- Citations: 39
ANDERSON EJ, NASH P, WEBER RR, 1982, A COUNTEREXAMPLE TO A CONJECTURE ON OPTIMAL LIST ORDERING, JOURNAL OF APPLIED PROBABILITY, Vol: 19, Pages: 730-732, ISSN: 0021-9002
- Author Web Link
- Cite
- Citations: 11
ANDERSON EJ, 1981, MAZES - SEARCH GAMES ON UNKNOWN NETWORKS, NETWORKS, Vol: 11, Pages: 393-397, ISSN: 0028-3045
- Author Web Link
- Cite
- Citations: 1
ANDERSON EJ, 1981, A NEW CONTINUOUS MODEL FOR JOB-SHOP SCHEDULING, INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, Vol: 12, Pages: 1469-1475, ISSN: 0020-7721
- Author Web Link
- Cite
- Citations: 40
This data is extracted from the Web of Science and reproduced under a licence from Thomson Reuters. You may not copy or re-distribute this data in whole or in part without the written consent of the Science business of Thomson Reuters.