On a Class of Concave-Separable Integer Programs.

Abstract

A class of nonlinear integer programs is introduced. Problems in this class are characterized by a concave and separable objective function subject to a set of linear constraints. It is shown how by suitably modifying the objective function, the theory of spearability in linear programming can be applied to derive efficient solution procedures for problems falling in this class. This work unifies and extends several results previously obtained independently in the literature. Two illustrative applications are discussed in some detail, and specified algorithms are presented for these examples. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1976
Accession Number
ADA033313

Entities

People

  • Gary A. Kochman

Organizations

  • Stanford University

Tags

Communities of Interest

  • Weapons Technologies

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Coefficients
  • Computer Programming
  • Contracts
  • Integer Programming
  • Integrals
  • Linear Programming
  • Military Research
  • Optimization
  • Scientific Research
  • Simplex Method
  • United States
  • United States Government

Fields of Study

  • Mathematics

Readers

  • Operations Research