• 沒有找到結果。

1 1 11 1 1 1 1 1 1 1 1.

N/A
N/A
Protected

Academic year: 2021

Share "1 1 11 1 1 1 1 1 1 1 1."

Copied!
2
0
0

加載中.... (立即查看全文)

全文

(1)

1. (25%) Consider the diet problem with the following data involving two nutrients (vitamins A, I<) with minimum daily requirements (MDR), and 5 different foods.

Nutrient Nutrient unitslunit food MDR for

1 2 3 4 5 nutrient

Vitamin A 1 0 1 1 2 2 1

Vitamin K 0 1 2 1 1 12

Cost (centslunit) 20 20 3 1 11 12

(a) (5%) Formulate the problem of finding a minimum cost diet meeting the requirements.

(b) (5%) Find an optimum solution for the problem. Let x and B denote

the optimum solution and basis obtained, respectively.

(c) (5%) For what range of values of c4 (costlunit of food 4) is the current

optimal solution x remains optimal?

(d) (5%) For what range of values of the MDR of vitamin K (whose present

value is 12) does the basis 3 remain optimal t o the problem?

(e) (2%) A local pharmacist is selling vitamin K pills at a cost of 12 centslunit of

vitamin K content. Is this price competitive with the available foods in meeting

this vitamin requirement?

(f) (3%) A delicious new food containing 3, 2 units of vitamins A, K respectively

per unit has become available at a price of 28 centslunit. How much is the urge

t o include at least 1 unit of this in the daily diet going t o cost, over a minimum

cost diet?

2. (10%) Construct a system of constraints including binary variables if necessary

whose feasible region is { ( x , , ~ , ] : 5 I X, 110,5 I x2 < 10).

3. (15%) Four customers are bidding for four valuable paintings. Customer 2 is

willing t o buy t w o paintings, but each other customer is willing t o purchase at most one painting. The prices that each customer is willing t o pay are given in the following table. Determine how t o maximize the total revenue received from the sale of the paintings by the Hungarian method.

Bid for ($)

Customer

Painting 1 Painting 2 Painting 3 Painting 4

(2)

LsdaydoM dadns aq l y l

!

~ vad!edad aadyl

aq l a3eldad leurodpunel

Jy l P1n04S 'le!luauodxa JJe

SJ UJ

J3!AJJS pUe !l

UMOpyeJlg 's~aholdLU.3 Je

ln 8~

J

aa

~y l aq

40 l

Aed a ql slenba

J

~

~ J O

M dadns a

yl jo AJeles ay l 'Aep

g b

aB 40

e~

a~

e

ue u!

au!y3ew e

~!

ed ad ue3

O

~ M 'J

~~

JO

M dadns e

y l

!

~ wa

qlB u!

3e ld a~

40 uo!ldo

aq l seq JewoJpunel a

yl4 o JauMo aq

l .Amp uo ade SJ JJ

!~

~J J aa

~y l 'Apua1dn3

.sAep S'Z

a8 40

e~

a~

e ue u!

au!qJew e J!edad ue3 JJ J!

~~

~J .sAep v s

A J

~ A

~ a3uo

u

~ o

p syeadq au!y3ew

le3!dAl

v

.s au

!y

~e w B u!

qs

s e~

sey IewoJpunel

v

(%oE)

.s

.Al!ep sales is01

Jaqwnu a 40

Be

~a

~e ay l ah!B 'aleis Apea~s

ul (%

o~

) (q)

'{

'X } U!ey3 AOyJeW Jy

l d o 4 X!JleU UO!l!SUeJl Jq

l JA!3 (%05)

(e)

.Aep ,,u ay lj o pua ay ll e ~ (a ys ay l u o sural!

Ja 40

qw nu a yl aq 'X 1a-j (.sales lsol paJap!suo3

s! alqel!eAe swal! a

yl Bu!paa3xa

p~

eU Ja a) '5'

= {E

a}dd 'Z' =

= {Z

a}Jd =

' E'

(5 =

a}dd =

= {O ' b.

a}dd JdJyM =

'a

Aq u a~

!8 s! w aq s!yl d o4 puewap Al!ep a

yl 'oslv 5!u!ylou saop

ay as!/v\Jaylo 'lno

a~

ow OM^

slnd ay 'sway oJaz

aJe a

~a yl jl 'v al aJe s wa y Aueur

~ o

y sy3ay3 )1

~a p

e 'Aep y3ea

Bu!uu!Baq a 40

lv yl .s wa

z ~!

JOJ woo^

sey a

~o ls e le Aelds!p

v

(%oz) 'b

參考文獻

相關文件

1: Invariant mass distribution and the leading lepton transverse momentum in data and simulation..

[r]

[r]

Read the Poster for the Shatin Festival of Performing Arts Song Writing Competition (Text 1) and answer questions 1-5.. Blacken the circle

[r]

It is interesting that almost every numbers share a same value in terms of the geometric mean of the coefficients of the continued fraction expansion, and that K 0 itself is

• A sequence of numbers between 1 and d results in a walk on the graph if given the starting node.. – E.g., (1, 3, 2, 2, 1, 3) from

Given a graph and a set of p sources, the problem of finding the minimum routing cost spanning tree (MRCT) is NP-hard for any constant p &gt; 1 [9].. When p = 1, i.e., there is only