# Teorema perluasan persediaan permintaan

Khamim , Khamim (2000) Teorema perluasan persediaan permintaan. Undergraduate thesis, FMIPA UNDIP.

PDF
Restricted to Repository staff only

1743Kb
 Preview
PDF
19Kb
 Preview
PDF
237Kb
 Preview
PDF
400Kb
 Preview
PDF
302Kb
 Preview
PDF
537Kb
PDF
Restricted to Repository staff only

783Kb
 Preview
PDF
211Kb

## Abstract

The Supply - Demand Net G(V,E,c1) is a directed Etraph which a node set V, aro set E, capacity function c, and flow fUaction f; where lower bound supply a(x), upper bound supply a YA, lower bound demand b(x), and upper bound demand b'(x). This conditions are happened if there is a flow meeting the lower bound requirements at each of the sources and the upper bound requirements at each of the sinks, and if there is a flow satisfying the upper bound requirements at each of the sources and the lower bound requirements at each of the sinks, then there is a feasible flow in the supply-demand net. Jaringan Persediaan-Penninthan G(V,E,c,/) menpakan suatu graph berarah yang terdiri dari himpunan titik V, himpunan garia S, fungal kapasitas c, dan bassi aliranf, dimana bates bawah persediaan a(.1), bates atas persediami d(2) dan bates bawah permintaan b(2) serta baths atas permintaan tiVO. Kondisi ml terjadi jika pada jaringan persediaan-permintaan (3*(TM,II*,ctr) terdapat math aliran yang memenuhi baths bawah. permintaan pada setiap amber don baths atas persediaan pada setiap tujuan, don jika pada jaringan persediaan-permintaan 0(V,E,c,f) terdapat suatu aliran yang memenuhi bathe atas persediaan pada setthp ember dan baths bawah permintaan pada setiap tujuan tnaka terdapat suatu aliran yang claktnijaringan pe e-diaan - permintaan:

Item Type: Thesis (Undergraduate) Q Science > QA Mathematics Faculty of Science and Mathematics > Department of Mathematics 31764 Mr UPT Perpus 1 24 Nov 2011 15:01 24 Nov 2011 15:01

Repository Staff Only: item control page