Precise Synthesis and Thin Film Self-Assembly of PLLA-b-PS Bottlebrush Block Copolymers

The ability of bottlebrush block copolymers (BBCPs) to self-assemble into ordered large periodic structures could greatly expand the scope of photonic and membrane technologies. In this paper, we describe a two-step synthesis of poly(l-lactide)-b-polystyrene (PLLA-b-PS) BBCPs and their rapid thin-film self-assembly. PLLA chains were grown from exo-5-norbornene-2-methanol via ring-opening polymerization (ROP) of l-lactide to produce norbornene-terminated PLLA. Norbonene-terminated PS was prepared using anionic polymerization followed by a termination reaction with exo-5-norbornene-2-carbonyl chloride. PLLA-b-PS BBCPs were prepared from these two norbornenyl macromonomers by a one-pot sequential ring opening metathesis polymerization (ROMP). PLLA-b-PS BBCPs thin-films exhibited cylindrical and lamellar morphologies depending on the relative block volume fractions, with domain sizes of 46–58 nm and periodicities of 70–102 nm. Additionally, nanoporous templates were produced by the selective etching of PLLA blocks from ordered structures. The findings described in this work provide further insight into the controlled synthesis of BBCPs leading to various possible morphologies for applications requiring large periodicities. Moreover, the rapid thin film patterning strategy demonstrated (>5 min) highlights the advantages of using PLLA-b-PS BBCP materials beyond their linear BCP analogues in terms of both dimensions achievable and reduced processing time.     

Generalization of Murty's direct algorithm to linear and convex quadratic programming

Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments.     

Carathéodory's method for a class of dynamic games

The method of equivalent variational methods, originally due to Carathéodory for free problems in the calculus of variations is extended to investigate feedback Nash equilibria for a class of n-person differential games. Both the finite-horizon and infinite-horizon cases are considered. Examples are given to illustrate the presented results.     

Solving Problems with Min-Type Functions by Disjunctive Programming

We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency.     

Sensitivity analysis for discrete optimal control problems

We present local sensitivity analysis for discrete optimal control problems with varying endpoints in the case when the customary regularity of boundary conditions can be violated. We study the behavior of the optimal solutions subject to parametric perturbations of the problem.     

Maximizing a Linear Fractional Function on a Pareto Efficient Frontier

We consider the problem of maximizing a linear fractional function on the Pareto efficient frontier of two other linear fractional functions. We present a finite pivoting-type algorithm that solves the maximization problem while computing simultaneously the efficient frontier. Application to multistage efficiency analysis is discussed. An example demonstrating the computational procedure is included.     

Primal cutting plane algorithms revisited

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.     

Constraint Programming and Operations Research: Comments from an Operations Researcher

This paper relates the author's personal experience with constraint programming and gives a personal assessment of the relationships between constraint programming and operations research.     

最速下降规则不失为一可用规则

本从统计意义上平均迭代次数的观点出发，指出求解线性规划的最速下降规则是可取的，好用的。     

线性分式规划最优解集的求法

本文使用多面集的表示定理，导出了线性分式规划最优解集的结构，并给出确定全部最优解的计算步骤。