Discrete Generalized Networks: Application to Integer Constrained Flow Problems.

Abstract

A generalized network structure is essentially a linear program whose coefficient matrix ignoring simple bounds on variables, contains at most two- non-zero entries in each column. When flow variables are required to be integers, the resulting problem is termed Discrete Generalized Network (DGN). The DGN structure has been used to model problems such as scheduling variable length networks, designing communication networks and capital allocation problems. The primary objective of this project has been to identify solution methodologies for problems having the DGN structure. Some secondary outcomes of the research include a program for generating random networks and an application of DGN formulation to model an important problem in flexible manufacturing systems. Keywords: Linear programs; Discrete generalized network; Manufacturing systems; Random networks.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 15, 1987
Accession Number
ADA190823

Entities

People

  • Sanjiv Sarin

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Classification
  • Communication Networks
  • Computer Programs
  • Computers
  • Engineering
  • Flow Network
  • Industrial Engineering
  • Linear Programming
  • Manufacturing
  • Military Research
  • North Carolina
  • Scheduling (Production)
  • Students
  • United States
  • Universities

Fields of Study

  • Mathematics

Readers

  • Computer Networking
  • Operations Research