Eaves, B. Curtis
Overview
Works:  66 works in 132 publications in 2 languages and 1,316 library holdings 

Genres:  Conference papers and proceedings Abstracts 
Roles:  Author, Editor, Other 
Publication Timeline
.
Most widely held works by
B. Curtis Eaves
Studies in optimization by
George B Dantzig(
Book
)
14 editions published in 1974 in English and held by 641 WorldCat member libraries worldwide
14 editions published in 1974 in English and held by 641 WorldCat member libraries worldwide
A course in triangulations for solving equations with deformations by
B. Curtis Eaves(
Book
)
15 editions published between 1981 and 1984 in English and German and held by 292 WorldCat member libraries worldwide
15 editions published between 1981 and 1984 in English and German and held by 292 WorldCat member libraries worldwide
Homotopy methods and global convergence by
B Curtis Eaves(
Book
)
15 editions published between 1982 and 1983 in English and held by 266 WorldCat member libraries worldwide
This Proceedings presents refereed versions of most of the papers presented at the NATO Advanced Research Institute on Homotopy Methods and Global Convergence held in Porto Cervo, Sardinia, June 36, 1981. This represents the fourth recent occurrence of an international conference addressing the common theme of fixed point computation. The first such conference, ti tled "Computing Fixed Points with Applications," was held in the Department of Mathematical Sciences at Clemson University, Clemson, South Carolina, June 2628, 1974 and was sponsored by the Office of Naval Research and the Office of the Army Research Center. The second conference, "Symposium on Analysis and Computation of Fixed Points," was held at the University of Wisconsin, Madison, May 78, 1979, under the sponsorship of the National Science Foundation, the U.S. Army, and the Mathematics Research Center of the University of Wisconsin, Madison. The third conference, titled "Symposium on Fixed Point Algorithms and Complementarity," was held at the University of Southampton, Southampton, UK, July 35, 1979 and was sponsored by U.N.E.S.C.O., European Research Office (London), Department of Mathematics (University of Southampton), I.B.M.U.K., Ltd., Lloyds Bank, Ltd., and the Office of Naval Research (London). The Advanced Research Institute held in Sardinia was devoted to the theory and application of modern homotopy methods. The following topics were stressed: PathFollowing Techniques; BottomLine Applications; Global vs. Classical Methods; and Sta v vi PREFACE oftheArt, Perspectives and Potential
15 editions published between 1982 and 1983 in English and held by 266 WorldCat member libraries worldwide
This Proceedings presents refereed versions of most of the papers presented at the NATO Advanced Research Institute on Homotopy Methods and Global Convergence held in Porto Cervo, Sardinia, June 36, 1981. This represents the fourth recent occurrence of an international conference addressing the common theme of fixed point computation. The first such conference, ti tled "Computing Fixed Points with Applications," was held in the Department of Mathematical Sciences at Clemson University, Clemson, South Carolina, June 2628, 1974 and was sponsored by the Office of Naval Research and the Office of the Army Research Center. The second conference, "Symposium on Analysis and Computation of Fixed Points," was held at the University of Wisconsin, Madison, May 78, 1979, under the sponsorship of the National Science Foundation, the U.S. Army, and the Mathematics Research Center of the University of Wisconsin, Madison. The third conference, titled "Symposium on Fixed Point Algorithms and Complementarity," was held at the University of Southampton, Southampton, UK, July 35, 1979 and was sponsored by U.N.E.S.C.O., European Research Office (London), Department of Mathematics (University of Southampton), I.B.M.U.K., Ltd., Lloyds Bank, Ltd., and the Office of Naval Research (London). The Advanced Research Institute held in Sardinia was devoted to the theory and application of modern homotopy methods. The following topics were stressed: PathFollowing Techniques; BottomLine Applications; Global vs. Classical Methods; and Sta v vi PREFACE oftheArt, Perspectives and Potential
Complementarity and Fixed Point Problems by
M. L Balinski(
Book
)
1 edition published in 1978 in English and held by 10 WorldCat member libraries worldwide
1 edition published in 1978 in English and held by 10 WorldCat member libraries worldwide
Computing equilibria in the GEI model by
Donald J Brown(
Book
)
5 editions published in 1993 in English and held by 10 WorldCat member libraries worldwide
5 editions published in 1993 in English and held by 10 WorldCat member libraries worldwide
A discountedcost continuoustime flexible manufacturing and operator scheduling model solved by deconvexification over time by
B. Curtis Eaves(
Book
)
3 editions published between 1990 and 1991 in English and held by 6 WorldCat member libraries worldwide
Abstract: "A discountedcost, continuoustime, infinitehorizon version of a flexible manufacturing and operator scheduling model is solved. The solution procedure is to convexify the discrete operator assignment constraints to obtain a linear program, and then to regain the discreteness and obtain an approximate manufacturing schedule by deconvexification of the solution of the linear program over time. The strong features of the model are the accommodation of linear inequality relations among the manufacturing activities and the discrete manufacturing scheduling, whereas the weak features are intraperiod relaxation of inventory availability constraints, and the absence of inventory costs, setup times, and setup charges."
3 editions published between 1990 and 1991 in English and held by 6 WorldCat member libraries worldwide
Abstract: "A discountedcost, continuoustime, infinitehorizon version of a flexible manufacturing and operator scheduling model is solved. The solution procedure is to convexify the discrete operator assignment constraints to obtain a linear program, and then to regain the discreteness and obtain an approximate manufacturing schedule by deconvexification of the solution of the linear program over time. The strong features of the model are the accommodation of linear inequality relations among the manufacturing activities and the discrete manufacturing scheduling, whereas the weak features are intraperiod relaxation of inventory availability constraints, and the absence of inventory costs, setup times, and setup charges."
Homotopy methods and global convergence : [proceedings of a NATO Advanced Research Institute on Homotopy Methods and Global
Convergence, held June 36, 1981, in Porto Cervo, Sardinia](
Book
)
1 edition published in 1983 in English and held by 5 WorldCat member libraries worldwide
1 edition published in 1983 in English and held by 5 WorldCat member libraries worldwide
Balanced simplices on polytopes by
B. Curtis Eaves(
Book
)
3 editions published in 1996 in English and held by 5 WorldCat member libraries worldwide
3 editions published in 1996 in English and held by 5 WorldCat member libraries worldwide
TimeDependent Mathematical Programs by
B. Curtis Eaves(
Book
)
5 editions published between 1971 and 1981 in English and Undetermined and held by 5 WorldCat member libraries worldwide
The research supported under this contract has led, in conjunction with results of others, to a general new tool for solving systems of equations (e.g., differential equations). (Author)
5 editions published between 1971 and 1981 in English and Undetermined and held by 5 WorldCat member libraries worldwide
The research supported under this contract has led, in conjunction with results of others, to a general new tool for solving systems of equations (e.g., differential equations). (Author)
Formulation of linear problems and solution by a universal machine by
B. Curtis Eaves(
Book
)
2 editions published in 1992 in English and held by 4 WorldCat member libraries worldwide
We describe a single, one, method, to which we refer as the Univeral Linear Machine, which can be used to solve any instance of any linear problem. The Universal Linear Machine runs in two phases. Given a linear problem, in the first phase a Compiler running on a Turing Machine generates an ordered field algorithm for the problem. Then, given an instance of the linear problem, in the second phase the ordered field algorithm solves the particular instance of the linear problem. The ordered field algorithm is finite, deterministic, loopless and executes only the five ordered field operations  additions, multiplications, subtractions, divisions and comparisons
2 editions published in 1992 in English and held by 4 WorldCat member libraries worldwide
We describe a single, one, method, to which we refer as the Univeral Linear Machine, which can be used to solve any instance of any linear problem. The Universal Linear Machine runs in two phases. Given a linear problem, in the first phase a Compiler running on a Turing Machine generates an ordered field algorithm for the problem. Then, given an instance of the linear problem, in the second phase the ordered field algorithm solves the particular instance of the linear problem. The ordered field algorithm is finite, deterministic, loopless and executes only the five ordered field operations  additions, multiplications, subtractions, divisions and comparisons
A flexible manufacturing and operator scheduling model solved by deconvexification over time by
B. Curtis Eaves(
Book
)
2 editions published in 1986 in English and held by 3 WorldCat member libraries worldwide
Abstract: "A flexible manufacturing and operator scheduling problem is introduced and solved. The principle concern is with scheduling operators over time to various activities of a manufacturing system with the purpose of optimizing some steady state criterion. In mathematical terms the problem is modeled as a deterministic, mixed integer, infinite horizon dynamic program. Our solution procedure is first to convexify the problem, then to apply linear programming, and finally to deconvexify the solution over time to arrive at an optimal solution. Apparent loss in the object value due to the deconvexifications is circumvented with buffer inventories. The procedure can be reduced to solving a sequence of linear programs and the complexity is stated in these terms."
2 editions published in 1986 in English and held by 3 WorldCat member libraries worldwide
Abstract: "A flexible manufacturing and operator scheduling problem is introduced and solved. The principle concern is with scheduling operators over time to various activities of a manufacturing system with the purpose of optimizing some steady state criterion. In mathematical terms the problem is modeled as a deterministic, mixed integer, infinite horizon dynamic program. Our solution procedure is first to convexify the problem, then to apply linear programming, and finally to deconvexify the solution over time to arrive at an optimal solution. Apparent loss in the object value due to the deconvexifications is circumvented with buffer inventories. The procedure can be reduced to solving a sequence of linear programs and the complexity is stated in these terms."
Odd theorem by
Stanford University(
Book
)
2 editions published in 1969 in English and held by 3 WorldCat member libraries worldwide
Let C be a bounded convex polyhedral set and let f:C(arrow)C be continuous and piecewise linear. Using notions from complementary pivot theory, it is shown that if each fixed point of f lies interior to some piece of linearity, then f has an odd number of fixed points. In addition, an algorithm is given for computing a fixed point of f
2 editions published in 1969 in English and held by 3 WorldCat member libraries worldwide
Let C be a bounded convex polyhedral set and let f:C(arrow)C be continuous and piecewise linear. Using notions from complementary pivot theory, it is shown that if each fixed point of f lies interior to some piece of linearity, then f has an odd number of fixed points. In addition, an algorithm is given for computing a fixed point of f
The linear complementarity problem in mathematical programming by
B. Curtis Eaves(
)
3 editions published between 1969 and 1976 in English and held by 3 WorldCat member libraries worldwide
The study centers on the task of efficiently finding a solution of the linear complementarity problem: Ix  My = q, x = or> 0, Y = or> 0, x perpendicular to y
3 editions published between 1969 and 1976 in English and held by 3 WorldCat member libraries worldwide
The study centers on the task of efficiently finding a solution of the linear complementarity problem: Ix  My = q, x = or> 0, Y = or> 0, x perpendicular to y
Homotopies for computation of fixed points on unbounded regions by
B. Curtis Eaves(
Book
)
1 edition published in 1971 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1971 in English and held by 2 WorldCat member libraries worldwide
Continuous time average cost flexible manufacturing and operator scheduling model solved by deconvexificiation over time by
Stanford University(
Book
)
2 editions published in 1987 in English and held by 2 WorldCat member libraries worldwide
Abstract: "A continuous time flexible manufacturing and operator scheduling problem is introduced and solved. The principle concern is with scheduling operators over time to various activities of a manufacturing system with the purpose of optimizing some steady state criterion. In mathematical terms the problem is modeled as a deterministic, infinite horizon, continuous time discrete dynamic program. Our solution procedure is to convexify the problem to obtain a linear program and, then, to deconvexify the solution of the linear program over time to arrive at an optimal solution which is periodic and piecewiseconstant. Apparant loss in object value due to the deconvexifications is circumvented with buffer inventories. The procedure can be reduced to solving a sequence of linear programs and the complexity can be stated in these terms."
2 editions published in 1987 in English and held by 2 WorldCat member libraries worldwide
Abstract: "A continuous time flexible manufacturing and operator scheduling problem is introduced and solved. The principle concern is with scheduling operators over time to various activities of a manufacturing system with the purpose of optimizing some steady state criterion. In mathematical terms the problem is modeled as a deterministic, infinite horizon, continuous time discrete dynamic program. Our solution procedure is to convexify the problem to obtain a linear program and, then, to deconvexify the solution of the linear program over time to arrive at an optimal solution which is periodic and piecewiseconstant. Apparant loss in object value due to the deconvexifications is circumvented with buffer inventories. The procedure can be reduced to solving a sequence of linear programs and the complexity can be stated in these terms."
Optimal Scaling of Balls and Polyhedra(
Book
)
1 edition published in 1980 in English and held by 2 WorldCat member libraries worldwide
A cell means either a nonempty closed polyhedral convex set or a nonempty closed solid ball. The concern is with solving as linear or convex quadratic programs special cases of the optimal containment problem and the optimal meet problem
1 edition published in 1980 in English and held by 2 WorldCat member libraries worldwide
A cell means either a nonempty closed polyhedral convex set or a nonempty closed solid ball. The concern is with solving as linear or convex quadratic programs special cases of the optimal containment problem and the optimal meet problem
Computing economic equilibria on affine networks with Lemke's algorithm by
Stanford University(
Book
)
2 editions published in 1977 in English and held by 2 WorldCat member libraries worldwide
Economic equilibria between supply and demand on certain affine multicommodity networks are characterized as solutions to a linear complementarity problem to which Lemke's algorithm is applied. (Author)
2 editions published in 1977 in English and held by 2 WorldCat member libraries worldwide
Economic equilibria between supply and demand on certain affine multicommodity networks are characterized as solutions to a linear complementarity problem to which Lemke's algorithm is applied. (Author)
Education in a research university by
Kenneth J Arrow(
Book
)
1 edition published in 1996 in English and held by 2 WorldCat member libraries worldwide
The research university is one of the most characteristic and important institutions of our time. It is an extremely complex entity, seeking to achieve a variety of aims and responding to a multiplicity of pressures. Its principal obligation is to educate students and to prepare them to live in and contribute to society. To serve this function, knowledge must be collected, organized, and disseminated, but perhaps even more important, new knowledge must be created. The knowledge so developed and imparted must ultimately be carried out into society, largely through former students but also by other means. The present volume is a collection of 30 essays on the character, administration, and management of research universities, with special emphasis on the perspective of statistics and operations research. It thus concentrates on issues of systematic planning, planning models, teaching approaches, and management associated with the aims and methods of operations research, although it also deals with more general concerns about the management of universities and university resources, and with some of the applications of operationsresearch and statistical tools that have moved outside university settings
1 edition published in 1996 in English and held by 2 WorldCat member libraries worldwide
The research university is one of the most characteristic and important institutions of our time. It is an extremely complex entity, seeking to achieve a variety of aims and responding to a multiplicity of pressures. Its principal obligation is to educate students and to prepare them to live in and contribute to society. To serve this function, knowledge must be collected, organized, and disseminated, but perhaps even more important, new knowledge must be created. The knowledge so developed and imparted must ultimately be carried out into society, largely through former students but also by other means. The present volume is a collection of 30 essays on the character, administration, and management of research universities, with special emphasis on the perspective of statistics and operations research. It thus concentrates on issues of systematic planning, planning models, teaching approaches, and management associated with the aims and methods of operations research, although it also deals with more general concerns about the management of universities and university resources, and with some of the applications of operationsresearch and statistical tools that have moved outside university settings
Properly labeled simplexes by
Stanford University(
Book
)
2 editions published in 1973 in English and held by 2 WorldCat member libraries worldwide
A generalization of Sperner's Lemma is considered; the model is defined and examples are developed. The proof is algorithmic and is based on recent results in complementary pivot theory and computation of fixed points. (Author)
2 editions published in 1973 in English and held by 2 WorldCat member libraries worldwide
A generalization of Sperner's Lemma is considered; the model is defined and examples are developed. The proof is algorithmic and is based on recent results in complementary pivot theory and computation of fixed points. (Author)
Elimination of quantifiers of linear variables and corresponding transfer principles by
B. Curtis Eaves(
Book
)
1 edition published in 1987 in English and held by 2 WorldCat member libraries worldwide
Abstract: "Given a first order formula for ordered fields whose quantified variables are linear with respect to each other, we show how to eliminate the quantifiers and obtain a quantifierfree formula that is equivalent to the original one over all ordered fields. The result parallels Tarski's Theorem that concerns the elimination of quantifiers for first order formula for ordered fields applied to real closed fields. Like Tarski's Theorem, our results yield transfer principles for drawing conclusions in one ordered field that are established for another. Applications of this transfer principle are discussed."
1 edition published in 1987 in English and held by 2 WorldCat member libraries worldwide
Abstract: "Given a first order formula for ordered fields whose quantified variables are linear with respect to each other, we show how to eliminate the quantifiers and obtain a quantifierfree formula that is equivalent to the original one over all ordered fields. The result parallels Tarski's Theorem that concerns the elimination of quantifiers for first order formula for ordered fields applied to real closed fields. Like Tarski's Theorem, our results yield transfer principles for drawing conclusions in one ordered field that are established for another. Applications of this transfer principle are discussed."
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Dantzig, George B. (George Bernard) 19142005 Author Editor
 North Atlantic Treaty Organization Scientific Affairs Division Editor
 Stanford University Department of Operations Research Systems Optimization Laboratory
 Rothblum, Uriel G.
 National Science Foundation (U.S.)
 DeMarzo, Peter M.
 United States Army Research Office
 STANFORD UNIV CALIF Dept. of OPERATIONS RESEARCH
 Balinski, Michel Louis
 Cottle, Richard W. 1934
Associated Subjects
Algebraic fields Computer science Convergence Economics Economics, Mathematical Equations, Roots of Equilibrium (Economics)Mathematical models Fixed point theory Flexible manufacturing systems Homotopy theory Linear complementarity problem Linear programming Mathematical optimization Mathematics Operations research Physics Piecewise linear topology Polytopes Production schedulingMathematical models Programming (Mathematics) ResearchSocial aspects ScienceStudy and teaching (Graduate) Simplexes (Mathematics) Stanford University Topological algebras Triangulating manifolds United States Universities and collegesResearchManagement