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.     

Polyethylenimine-Containing Cotton Fabrics

Abstract

Polyethylenimine-containing cotton fabrics were prepared by reaction of 1-epoxyethyl-3, 4-epoxycyclohexane with cotton fabric impregnated with polyethylenimine of a moderately high molecular weight. Fabrics with a high unremovable polyethylenimine content and with a different degree of cross-linking were obtained. Adsorption of several heavy metal salts such as mercuric chloride and cupric sulfate by the fabrics was investigated. Adsorption was controlled by polyethylenimine content of the fabric, extent of cross-linking, and the pH of the solution.     

Analysis of multiobjective decision problems by the indifference band approach

A new approach, based on indifference band, for analyzing problems with multiple objectives is described. The relations of this approach to some previous results are given. Methods for generating nondominated solutions are supplied.     

Low temperature magnetic properties of trimeric clusters

The degeneracy in the Heisenberg model of the three chromium clusters having D₃ symmetry is split by the antisymmetric exchange interaction. Based on this new energy level scheme, the low temperature behavior of the specific heat and magnetic susceptibility are reexamined.     

A convex-like duality scheme for quasi-convex programs

This paper describes a symmetric duality relation for quasi-convex programs. We are able to strengthen previous results and to define necessary and sufficient conditions for the absence of duality gap. In the present scheme one can generate quasi-convex quasi-concave Lagrangians and discuss the correspondence between saddle points of the Lagrangians and the solutions to the dual and primal programs. The present scheme is very similar to Rockafellar's scheme for convex programs and in this sense it may be viewed as a unified approach. Several examples are also given.     

A new method for calculation of the magnetic properties in one- and two-dimensional spin systems with anisotropic Heisenberg exchange

A new approximation method is proposed for the calculation of the magnetic susceptibility of one-dimensional assembly of spins and the critical temperature of two-dimensional one both with the anisotropic Heisenberg exchange. In a linear chain system, every spins are grouped into pairs of adjacent spins (pair-approximation) or clusters of adjacent three spins ((q+1)-approximation), and the partition function of the total spin system is approximated as a sum of products of the partitions functions for the pairs or the clusters. Then the partition function of the anisotropic Heisenberg spin system is shown to reduce into a form of the Ising spin system with modified coupling constants. The exact result for the Ising chain system enables us to obtain an analytical expression for the magnetic susceptibility of anisotropic Heisenberg chain system. The same approximations are also applied to two-dimensional lattices, and the critical temperatures of the square, triangular, and honeycomb lattices with anisotropic Heisenberg exchange are calculated as a function of anisotropy parameter. The results are compared with those of the existing theories and shown to be quite excellent.     

Duality for a class of quasiconvex programs

This paper derives a duality relation between a pair of explicitly quasiconvex and quasiconcave programs.     

A note on the maximum of quasiconcave functions

It is shown that the class of weakly nonconstant functions possesses the property that every local maximum is global. This is also a necessary condition.The authors would like to thank Professor B. Martos for his helpful comments.     

Pseudo-duality and saddle points

Results associated with saddle-type stationary points are described. It is shown that barrier-type functions are pseudo-duals of generalized Lagrangian functions, while augmented Lagrangians are pseudo-duals of the regular Lagrangian function. An application of pseudo-duality to a min-max problem is illustrated, together with several other examples.     

Condensing generalized polynomials

An extension of geometric programming to includegeneralized polynomials, and not onlyPositive polynomials, is described, together with an algorithm and a numerical example.