The increased importance of high value-added specialty chemicals has stimulated interest in the development of better design and optimization methods for batch processes. These processes have a number of particular aspects (time-dependent behavior, discrete processing and structural alternatives) which make the development of optimal designs quite difficult. Five sets of decisions must be made to design a batch process. Because the entire problem is so complex, previous workers have focused on smaller, more manageable parts of the overall problem. Much of the previous work has dealt with the optimal sizing of equipment units in order to produce a set of products in a new multiproduct batch plant with minimum capital investment. Processing conditions have generally been assumed given in the form of the product recipes and not subject to change. This thesis focuses on the design and operation of batch processes and represents a first attempt to consider process performance issues and equipment sizing decisions together in an optimization framework. Complexities introduced by using existing equipment are also included. The optimization problem consists of selecting the equipment units to use at each stage in the process and choosing values for all process operating conditions and operating times in order to optimize a suitable objective function.A problem formulation for the optimal design of a new batch process is developed. This formulation incorporates the effects of the overall multipurpose plant environment on the design of a single new process by allocating fixed costs through the use of equipment usage charges. These charges represent the opportunity cost of allocating scarce plant resources to one product rather than another. A decomposition strategy is proposed for solving the optimization problem. By partitioning the decision variables into two groups, simpler subproblems are generated.The Performance Subproblem involves optimizing the continuous variables that represent the processing conditions and operation times for a process with fixed structure. Generic performance trade-offs involving processing intensity and the distribution of performance load are identified. The problem is formulated as a nonlinear programming problem (NLP) and solved using a successive quadratic programming algorithm. Results 2 are reported for a series of test problems to illustrate the basic elements of the solution approach.The Structure Subproblem involves assigning known equipment units to stage locations for a process with fixed performance in order to minimize the total equipment usage charges. The combinatorial optimization problem can be formulated as a mixed integer nonlinear programming problem (MINLP) and solved using mathematical programming methods such as the Outer Approximation, Equality Relaxation method. To circumvent potentially large solution times, an approximate solution strategy based on local search techniques is developed. This approximate method generates near-optimal solutions and requires one...