THE LINEAR-LOGARITHMIC PROGRAMMING PROBLEM

Abstract

The algebraic solution of the linear-logarithmic programming problem is developed, derived by means of Lagrange multipliers. Then, two numerical methods for solving the problem are given, one of which is a generalization of a method previously used to solve the chemical equilibrium problem. Convergence was not proven for either of these methods; however, a number of large chemical equilibrium problems were solved using one or both of the methods.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1963
Accession Number
AD0407547

Entities

People

  • R. J. Clasen

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Air Force
  • Chemical Equilibrium
  • Complex Mixtures
  • Computer Programming
  • Computers
  • Contracts
  • Convergence
  • Corporations
  • Equations
  • Government Procurement
  • Governments
  • Mathematical Models
  • Procurement
  • Respiratory System
  • United States

Fields of Study

  • Mathematics

Readers

  • Operations Research