Scribd
Upload
5 views4 pages

Problem or

The document outlines multiple optimization problems, each with distinct objective functions and constraints, focusing on maximizing or minimizing certain variables. Problems include constraints related to resources, capacities, and non-negativity conditions for various variables. The document also specifies the end conditions for each problem, indicating the results or feasibility of the solutions.

Uploaded by

ejtraya80
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views4 pages

Problem or

The document outlines multiple optimization problems, each with distinct objective functions and constraints, focusing on maximizing or minimizing certain variables. Problems include constraints related to resources, capacities, and non-negativity conditions for various variables. The document also specifies the end conditions for each problem, indicating the results or feasibility of the solutions.

Uploaded by

ejtraya80
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

PROBLEM 1 PROBLEM 3

max=15000*X1+4500*X2+22000*X3; !Objective MIN = 5*X1 + 7*X2 + 8*X3 + 6*X4 + 4*X5 + 10*X6;


Function; !OBJECTIVE FUNCTION;
!Constraints; !CONSTRAINTS;
8*X1+3*X2+12*X3<=480; !Carpentry; X1 + X2 + X3 <= 400; !WAREHOUSE A;
4*X1+2*X2+8*X3<=300; !Finishing; X4 + X5 + X6 <= 600; !WAREHOUSE B;
2*X1+X2+3*X3<=120; !Quality Control; X1 + X4 = 200; !STORE 1;
X1>=10; !Min Dining Table;
X2 + X5 = 500; !STORE 2;
X2>=4*X1; !Armchair Condition;
X3 + X6 = 300; !STORE 3;
X1>=0; !non-negativity;
X1>=0; !non-negativity;
X2>=0; !non-negativity;
X2>=0; !non-negativity;
X3>=0; !non-negativity;
X3>=0; !non-negativity;
End (58,4,888000)
Y1>=0; !non-negativity;

Y2>=0; !non-negativity;
PROBLEM 2
Y3>=0; !non-negativity;
max=250*X1+180*X2+140*X3; !Objective
Function; END (100,300,100,500,5500)

!Constraints;

12*X1+10*X2+7*X3<=5000; !Oak; Problem 4

5*X1+4*X2+3*X3<=2500; !Labor; MIN = 40*X1 + 52*X2; !Cost

X1>=50; !min executive; X1 + X2 = 10000; !Total barrels

X1>=0; !non-negativity; (85*X1 + 94*X2)/(X1+X2) >= 90; !Octane

X2>=0; !non-negativity; (0.5*X1 + 0.2*X2)/(X1+X2) <= 0.35; !Sulfur

X3>=0; !non-negativity; X1, X2 >= 0;

End (416.67,104166.7) END (444,555,46666)

POMQM

40 50

1 1 <=1000

-5 4 <=0
Problem 5 P7

MIN = X1 + X2 + X3 + X4 + X5 + X6; !OBJECTIVE MIN = 0.30*X1 + 0.90*X2; !Cost;


FUNCTION;
!Constraints;
!CONSTRAINTS;
X1 + X2 = 500; !Batch size;
X1 + X6 >= 15;
0.10*X1 + 0.40*X2 >= 0.25*(X1+X2); !Protein;
X1 + X2 >= 20;
800*X1 + 400*X2 >= 600*(X1+X2); !Vitamins;
X2 + X3 >= 40;
X1 >= 0; !Non-negativity;
X3 + X4 >= 30;
X2 >= 0; !Non-negatity;
X4 + X5 >= 25;
End (300,250,250)
X5 + X6 >= 20;
0.30 0.90
X1>=0; X2>=0; X3>=0;
1 1 = 500
X4>=0; X5>=0; X6>=0;
-0.15 0.15 >=0
END (15,15,15,5,20,80)
200 -200>=0

P6
P8
MAX=20000*X1+6000*X2; !NON-NEGATIVITY;
MAX = 25*C + 45*S + 70*B; !OBJECTIVE
!CONSTRAINTS; FUNCTION;

1500*X1+400*X2=20000; !BUDGET; !CONSTRAINTS;

X1>=10; !MAX TV ADS; 2*C + 3*S + 5*B <= 2400; !TIME (40 HOURS);

X2>=X1; !SOCIAL; 5*C + 10*S + 15*B <= 5000; !BUDGET;

X1>=0; !NON-NEGATIVITY; C>=0;

X2>=0; !NON-NEGATIVITY; S>=0;

END (10,12,275000) B>=0;

20000 6000 END (2,500,1000)

1500 400 = 20000

1 0 ≥ 10

-1 1≥ 0
P9 P11

MAX = 0.07*X1 + 0.04*X2; !Return MIN = 10*X1 + 12*X2 + 2*X3; !OBJECTIVE


FUNCTION;
X1 + X2 = 100000; !Total investment
!CONSTRAINTS;
X2 >= 30000; !Bonds minimum
X1 <= 130; !MONTH 1 CAPACITY;
X1 <= 2*X2; !Stocks ≤ 2 × Bonds
X2 <= 130; !MONTH 2 CAPACITY;
(8*X1 + 2*X2)/(X1+X2) <= 5; !Risk constraint
X1 - X3 = 100; !MONTH 1 DEMAND;
X1 >= 0; !Non-negativity
X2 + X3 = 150; !MONTH 2 DEMAND;
X2 >= 0; !Non-negativity
X1>=0; !non-negativity;
END
X2>=0; !non-negativity;
0.07 0.04
X3>=0; !non-negativity;
1 1 =100000
END (120,130,20,2800)
0 1 >=30000

1 -2 <=0
P12
3 -3 <=0
MIN = 2*X1 + 3*X2 + 1*X3 + 4*X4+ 1000*X5 +
1200*X6; !OBJECTIVE FUNCTION;
P10
!CONSTRAINTS;
MIN = 10*X1 + 10*X2 + 25*X3; !OBJECTIVE
X1 + X2 <= 500;
FUNCTION;
X3 + X4 <= 500;
!CONSTRAINTS;
X1 + X3 = 400;
3*X1 + X3 >= 150; !30-INCH DEMAND;
X2 + X4 = 400;
2*X2 + X3 >= 200; !45-INCH DEMAND;
X1>=0; !non-negativity;
X1>=0;
X2>=0; !non-negativity;
X2>=0;
X3>=0; !non-negativity;
X3>=0;
X4>=0; !non-negativity;
END (1500,50,100)
END (1600,400,400)
PROBLEM 13 PROBLEM 16

MIN = 20*X1 + 30*X2; !OBJECTIVE FUNCTION; MAX = 1200*X1 + 600*X2; !Revenue;

!CONSTRAINTS; !CONSTRAINTS;

X1 <= 40; !REGULAR HOURS; X1 + X2 = 200; !Total beds;

X2 <= 10; !OVERTIME LIMIT; 3*X1 + 1*X2 <= 300; !Nurse limit;

X1 + X2 = 60; !TOTAL REQUIRED; X1 >= 0.25*(X1+X2); !Surgery ≥ 25%;

X1>=0; !NON-NEGATIVITY; X1 >= 0; !Non-negativity;

X2>=0; !NON-NEGATIVITY; X2 >= 0; !Non-negativity;

END (no feasible solution) END (150000,50,150)

PROBLEM 14 PROBLEM 17

MIN = 30*H1 + 20*H2; !Labor cost

20*H1 + 15*H2 = 1000; !Demand volume

0.02*(20*H1) + 0.05*(15*H2) <= 30; !Error limit

H1 <= 8; !Max hours/day

H2 <= 8; !Max hours/day

H1 >= 0; H2 >= 0; !Non-negativity

END

PROBLEM 15

MAX = 250*X1 + 180*X2 + 140*X3; !OBJECTIVE


FUNCTION;

!CONSTRAINTS;

12*X1 + 10*X2 + 7*X3 <= 5000;

5*X1 + 4*X2 + 3*X3 <= 2500;

X1 >= 50; !EXECUTIVE DESK;

X1>=0; !NON-NEGATIVITY;

X2>=0; !NON-NEGATIVITY;

X3>=0; !NON-NEGATIVITY;

END (416,104166)

You might also like