The Linear-Logarithmic Programming Problem.

R. J. Clasen

ResearchPublished 1963

The development of the algebraic solution of the linear-logarithmic programming problem, derived by means of Lagrange multipliers. Two numerical methods for solving the problem are then given, one of which is a generalization of a method previously used to solve the chemical equilibrium problem. Convergence has not been proven for either of these methods; a number of large chemical equilibrium problems, however, have been solved using one or both of the methods. 17 pp

Topics

Document Details

Citation

Chicago Manual of Style

Clasen, R. J., The Linear-Logarithmic Programming Problem. Santa Monica, CA: RAND Corporation, 1963. https://www.rand.org/pubs/research_memoranda/RM3707.html.
BibTeX RIS

This publication is part of the RAND research memorandum series. The research memorandum series, a product of RAND from 1948 to 1973, included working papers meant to report current results of RAND research to appropriate audiences.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.

RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.