Lab5 Gams Formulation

NAME: KETAN PATEL
EN.NO:12102020503006
Q.1 Optimize the objective function with lp maximization of z=3*x1 - x2; with constraints 2*x1 +
x2>2; x1 + 3*x2<4.
CODE:
Free Variable x1,x2,z;
Equations
Con1,
Con2,
Con3,
Obj;
Con1.. 2*x1+x2 =G=2;
Con2.. x1+3*x2 =L=3 ;
Con3.. x2 =L=4 ;
Obj.. 3*x1-x2 =E=z;
Model Ketan/
Con1,
Con2,
Con3,
Obj/;
Options LP = Cplex;
Solve Ketan using LP maximizing z;
Display x1.L,x2.L,z.L;
SOLVE SUMMARY
EN.NO:12102020503010
MODEL Ketan OBJECTIVE z
TYPE LP DIRECTION MAXIMIZE
SOLVER CPLEX FROM LINE 24
**** SOLVER STATUS 1 Normal Completion
**** MODEL STATUS 3 Unbounded
**** OBJECTIVE VALUE 3.0000
RESOURCE USAGE, LIMIT 0.047 10000000000.000
ITERATION COUNT, LIMIT 1 2147483647
--- *** This solver runs with a demo license. No commercial use.
--- GMO setup time: 0.00s
--- GMO memory 0.50 Mb (peak 0.50 Mb)
--- Dictionary memory 0.00 Mb
--- Cplex 22.1.0.0 link memory 0.00 Mb (peak 0.00 Mb)
--- Starting Cplex
--- LP status (4): unbounded or infeasible.
--- Cplex Time: 0.02sec (det. 0.00 ticks)
*** WARNING: Presolve found the problem infeasible or unbounded ---
Rerunning with presolve turned off and solving with LPMETHOD=1.
--- LP status (2): unbounded.
Model has an unbounded ray
LOWER LEVEL UPPER MARGINAL ----
EQU Con1 2.000 2.000 +INF 1.500 NOPT
---- EQU Con2 -INF 1.000 3.000 .
---- EQU Con3 -INF . 4.000 .

EN.NO:12102020503010
---- EQU Obj . . . -1.000
LOWER LEVEL UPPER MARGINAL
---- VAR x1 -INF 1.000 +INF . ----
VAR x2 -INF . +INF -2.500 UNBND
---- VAR z -INF 3.000 +INF .
**** REPORT SUMMARY : 1 NONOPT ( NOPT)
0 INFEASIBLE
1 UNBOUNDED (UNBND)
GAMS 41.5.0 2a5a4ddc Jan 3, 2023 WEX-WEI x86 64bit/MS Windows - 03/03/23 18:56:52 Page
7
General Algebraic Modeling System
Execution
---- 26 VARIABLE x1.L = 1.000
VARIABLE x2.L = 0.000
VARIABLE z.L = 3.000
EXECUTION TIME = 0.593 SECONDS 3 MB 41.5.0 2a5a4ddc WEX-WEI
USER: GAMS Demo license for Vyom javia G230205|0002CO-GEN
GH PATEL COLLEGE OF ENGINEERING AND TECHNOLOGY, India DL084667
**** FILE SUMMARY
Input C:\Users\ADMIN\Documents\gamsdir\projdir\Untitled_1.gms
EN.NO:12102020503010
Output C:\Users\ADMIN\Documents\gamsdir\projdir\Untitled_1.lst
Q.2 Optimize the objective function with lp maximization of 12*x1 + 15*x2 + 14*x3; with
constraints - 1*x1 + x2 >0;-1*x1 + 2*x3<100.
CODE:
Free Variable x1,x2,x3,z;
Equations
Con1,
Con2,
Con3,
Obj;
Con1.. 1*x1+x2 =G=0;
Con2.. -1*x1+2*x3 =L=0 ;
Con3.. x1+x2+x3 =L=100 ;
Obj.. 12*x1+15*x2+14*x3 =E=z;
Model Ketan/
Con1,
Con2,
Con3,
Obj/;
Options LP = Cplex;
Display x1.L,x2.L,x3.L,z.L;
SOLVE SUMMARY

EN.NO:12102020503010
--- Starting Cplex
---- EQU Con1 . 66.667 +INF .
---- EQU Con2 -INF . . 0.667

EN.NO:12102020503010
---- EQU Con3 -INF 100.000 100.000 12.667
---- EQU Obj . . . -1.000
---- VAR x1 -INF 66.667 +INF . ----
VAR x2 -INF . +INF 2.333 UNBND
---- VAR x3 -INF 33.333 +INF .
---- VAR z -INF 1266.667 +INF .
**** REPORT SUMMARY : 0 NONOPT
0 INFEASIBLE
1 UNBOUNDED (UNBND)
7
Execution
---- 26 VARIABLE x1.L = 66.667
USER: GAMS Demo license for vyom javia G230205|0002CO-GEN
**** FILE SUMMARY

EN.NO:12102020503010
Q.3 Optimize the objective function with lp maximization of

2.17*x2+32*x4+13.96*x6+20.6*x7+3.66*x8+4.5*x10; with constraints 1.65*x2
CODE:
Free Variable x2,x4,x6,x7,x8,x10,z;
Equations
Con1,
Con2,
Con3,
Con4,
Con5,
Con6,
Obj;
Con1.. 1.65*x2 =L=1700;
Con2.. 0.5*x4 =L=780 ;
Con3.. 1.04*x6 =L=5 ;
Con4.. 0.98*x7 =L=80;
Con5.. 0.36*x8 =L=10;
Con6.. 1.6*x10 =L=100;
Obj.. 2.17*x2+32*x4+13.96*x6+20.6*x7+3.66*x8+4.5*x10 =E=z;
Model Ketan/
Con1,
Con2,
EN.NO:12102020503010
Con3,
Con4,
Con5,
Con6,
Obj/;
Options LP = Cplex;
Display x2.L,x4.L,x6.L,x7.L,x8.L,x10.L,z.L;
SOLVE SUMMARY
**** MODEL STATUS 1 Optimal
--- Starting Cplex

EN.NO:12102020503010
--- LP status (1): optimal.
Optimal solution found
Objective: 54287.422280
---- EQU Con1 -INF 1700.000 1700.000 1.315
---- EQU Con2 -INF 780.000 780.000 64.000
---- EQU Con3 -INF 5.000 5.000 13.423
---- EQU Con4 -INF 80.000 80.000 21.020
---- EQU Con5 -INF 10.000 10.000 10.167
---- EQU Con6 -INF 100.000 100.000 2.812
---- EQU Obj . . . -1.000
---- VAR x2 -INF 1030.303 +INF .
---- VAR x4 -INF 1560.000 +INF .
---- VAR x6 -INF 4.808 +INF .
---- VAR x7 -INF 81.633 +INF .
---- VAR x8 -INF 27.778 +INF .
---- VAR x10 -INF 62.500 +INF .
---- VAR z -INF 54287.422 +INF .
0 INFEASIBLE
0 UNBOUNDED
EN.NO:12102020503010
7
Execution
---- 35 VARIABLE x2.L = 1030.303
USER: GAMS Demo license for ketan patelG230205|0002CO-GEN
**** FILE SUMMARY
Q.4 . Optimize the function using maximization of 6*M1+4*M2+7*M3+5*M4; with

constraints 6*M1+5*M2+3*M3+2*M4<20.
CODE:
Free Variable M1,M2,M3,M4,z;
Equations
Con1,
Con2,
Con3,
Obj;
Con1.. 6*M1+5*M2+3*M3+2*M4 =L=100;
Con2.. 3*M1+4*M2+9*M3+2*M4 =L=75;
Con3.. M1+2*M2+M3+2*M4 =L=20 ;
Obj.. 6*M1+4*M2+7*M3+5*M4 =E=z;
Model Ketan/
Con1,
Con2,
Con3,
Obj/;
Options LP = Cplex;
Display M1.L,M2.L,M3.L,M4.L,z.L;
SOLVE SUMMARY

EN.NO: 12102020503006
--- Starting Cplex
---- EQU Con1 -INF 100.000 100.000 0.528
---- EQU Con2 -INF 75.000 75.000 0.431
---- EQU Con3 -INF 20.000 20.000 1.542
---- EQU Obj . . . -1.000
---- VAR M1 -INF 14.722 +INF .
---- VAR M2 -INF . +INF -3.444 UNBND
---- VAR M3 -INF 3.194 +INF .

EN.NO:12102020503010
---- VAR M4 -INF 1.042 +INF .
---- VAR z -INF 115.903 +INF .
0 INFEASIBLE
1 UNBOUNDED (UNBND)
7
Execution
---- 26 VARIABLE M1.L = 14.722
VARIABLE M2.L = 0.000
USER: GAMS Demo license for Ketan patel G230205|0002CO-GEN
**** FILE SUMMARY
Q.5 Optimize the functions using function with lp minimization 3*x1+2*x2+2*x3; with
constraints 5*x1+7*x2+4*x3<-2; 3*x1+4*x2-6*x3>29/7.
CODE:
Free Variable x1,x2,x3,z;
Equations
Con1,
Con2,
Con3,
Obj;
Con1.. 5*x1+7*x2+4*x3 =L=7;
Con2.. -4*x1+7*x2+4*x3 =L=-2;
Con3.. 3*x1+4*x2-6*x3 =L=29/7 ;
Obj.. 3*x1+2*x2+2*x3 =E=z;
Model Ketan/
Con1,
Con2,
Con3,
Obj/;
Options LP = Cplex;
SOLVE SUMMARY

EN.NO:12102020503010
--- Starting Cplex
---- EQU Con1 -INF 7.000 7.000 0.460
---- EQU Con2 -INF -2.000 -2.000 -0.175 NOPT
---- EQU Con3 -INF 4.143 4.143 .
---- EQU Obj . . . -1.000

EN.NO:12102020503010
---- VAR x1 -INF 1.000 +INF .
---- VAR x2 -INF 0.286 +INF . ----
VAR x3 -INF . +INF 0.857 UNBND ----
VAR z -INF 3.571 +INF .
0 INFEASIBLE
1 UNBOUNDED (UNBND)
7
Execution
---- 26 VARIABLE x1.L = 1.000
USER: GAMS Demo license for ketan Patel G230205|0002CO-GEN
**** FILE SUMMARY
EN.NO:12102020503010
Q.6 Optimize the function with lp minimization

x11+3*x12+2*x13+2*x21+4*x22+3*x23+3*x31+x32+2*x33; Using constraints
x11+x12+x13;x21+x22+x23; x31+x32+x33;x11+x21+x31;x12+x22+x32; x13+x23+x33 all
constraints are less than 1.
CODE:
Free Variable x11,x12,x13,x21,x22,x23,x31,x32,x33,z;
Equations
Con1,
Con2,
Con3,
Con4,
Con5,
Con6,
Obj;
Con1.. x11+x12+x13 =L=1;
Con2.. x21+x22+x23 =L=1;
Con3.. x31+x32+x33 =L=1;
Con4.. x11+x21+x31 =L=1;
Con5.. x12+x22+x32 =L=1;
Con6.. x13+x23+x33 =L=1;
Obj.. x11+3*x12+2*x13+2*x21+4*x22+3*x23+3*x31+x32+2*x33 =E=z;
Model Ketan/
Con1,
Con2,
EN.NO:12102020503010
Con3,
Con4,
Con5,
Con6,
Obj/;
Options LP = Cplex;
Display x11.L,x12.L,x13.L,x21.L,x22.L,x23.L,x31.L,x32.L,x33.L,z.L;
SOLVE SUMMARY
--- Starting Cplex

EN.NO:12102020503010
---- EQU Con1 -INF 1.000 1.000 4.000
---- EQU Con2 -INF 1.000 1.000 5.000
---- EQU Con3 -INF 1.000 1.000 2.000
---- EQU Con4 -INF 1.000 1.000 1.000
---- EQU Con5 -INF 1.000 1.000 -1.000 NOPT
---- EQU Con6 -INF 1.000 1.000 .
---- EQU Obj . . . -1.000
---- VAR x11 -INF . +INF -4.000 UNBND
---- VAR x12 -INF 1.000 +INF .
---- VAR x13 -INF . +INF -2.000
---- VAR x21 -INF . +INF -4.000
---- VAR x22 -INF 1.000 +INF .
---- VAR x23 -INF . +INF -2.000
---- VAR x31 -INF 1.000 +INF .
---- VAR x32 -INF -1.000 +INF .
---- VAR x33 -INF 1.000 +INF .

EN.NO:12102020503010
---- VAR z -INF 11.000 +INF .
0 INFEASIBLE
1 UNBOUNDED (UNBND)
7
Execution
---- 35 VARIABLE x11.L = 0.000
VARIABLE x32.L = -1.000
USER: GAMS Demo license for KETAN PATELG230205|0002CO-GEN
**** FILE SUMMARY
EN.NO:12102020503010
Q.7 Optimize function with lp maximization

(0.03*Xa1)+(0.025*Xa2)+(0.035*Xb1)+(0.04*Xb2)+(0.05*Xc1)+(0.045*Xc2); with
constraints Xa1 + Xa2 + Xb1 + Xb2 + Xc1 + Xc2 = 10000; Xa1 + Xa2 > 4000; Xb1 + Xb2 <
3500; Xc1 + Xc2
CODE:
Free Variable Xa1,Xa2,Xb1,Xb2,Xc1,Xc2,z;
Equations
Con1,
Con2,
Con3,
Con4,
Obj;
Con1.. Xa1+Xa2 + Xb1 + Xb2 + Xc1 + Xc2 =E= 10000;
Con2.. Xa1 + Xa2 =G=4000;
Con3.. Xb1 + Xb2 =L=3500;
Con4.. Xc1 + Xc2 =L=3500;
Obj.. (0.03*Xa1)+(0.025*Xa2)+(0.035*Xb1)+(0.04*Xb2)+(0.05*Xc1)+(0.045*Xc2) =E=z;
Model Ketan/
Con1,
Con2,
Con3,
Con4,
Obj/;
Options LP = Cplex;

EN.NO:12102020503010
Display Xa1.L,Xa2.L,Xb1.L,Xb2.L,Xc1.L,Xc2.L,z.L;
SOLVE SUMMARY
--- Starting Cplex
*** WARNING: Presolve found the problem infeasible or unbounded
--- Rerunning with presolve turned off and solving with LPMETHOD=1.

EN.NO:12102020503010
---- EQU Con1 10000.000 10000.000 10000.000 0.030
---- EQU Con2 4000.000 6500.000 +INF .
---- EQU Con3 -INF . 3500.000 .
---- EQU Con4 -INF 3500.000 3500.000 0.020 ----
EQU Obj . . . -1.000
LOWER LEVEL UPPER MARGINAL ----
VAR Xa1 -INF 6500.000 +INF .
---- VAR Xa2 -INF . +INF -0.005 UNBND
---- VAR Xb1 -INF . +INF 0.005
---- VAR Xb2 -INF . +INF 0.010
---- VAR Xc1 -INF 3500.000 +INF .
---- VAR Xc2 -INF . +INF -0.005
---- VAR z -INF 370.000 +INF .
0 INFEASIBLE
1 UNBOUNDED (UNBND)
7
Execution
---- 29 VARIABLE Xa1.L = 6500.000
VARIABLE Xa2.L = 0.000
VARIABLE Xb1.L = 0.000
VARIABLE Xb2.L = 0.000

EN.NO:12102020503010
VARIABLE Xc1.L = 3500.000
VARIABLE Xc2.L = 0.000
USER: GAMS Demo license for KETAN PATEL G230205|0002CO-GEN
**** FILE SUMMARY
Q.8 Optimize function with lp maximization for function 7*y1 + 4*y2 - 10*y3 + 3*y4 +
2*y5; for given constraints 3*y1 + 6*y2 - 7*y3 + y4 + 4*y5 < 3; 5*y1 + y2 + 2*y3 - 2*y4 +
7*y5 <-2; 4*y1 + 3*y2 + y3 + 5*y4 - 2*y5 <4.
CODE:
Free Variable y1,y2,y3,y4,y5,z;
Equations
Con1,
Con2,
Con3,
Obj;
Con1.. 3*y1 + 6*y2 - 7*y3 + y4 + 4*y5 =L=3;
Con2.. 5*y1 + y2 + 2*y3 - 2*y4 + 7*y5 =L=-2;
Con3.. 4*y1 + 3*y2 + y3+ 5*y4 - 2*y5 =L=4;
Obj.. 7*y1 + 4*y2 - 10*y3 + 3*y4 + 2*y5 =E=z;
Model Ketan/
Con1,
EN.NO:12102020503010
Con2,
Con3,
Obj/;
Options LP = Cplex;
Display y1.L,y2.L,y3.L,y4.L,y5.L,z.L;
SOLVE SUMMARY
--- Starting Cplex

EN.NO:12102020503010
--- Could not determine which row or columns may have causedthe problem to be un
bounded
---- EQU Con1 -INF 3.000 3.000 -0.727 NOPT
---- EQU Con2 -INF -5.636 -2.000 .
---- EQU Con3 -INF 4.000 4.000 -0.455 NOPT
---- EQU Obj . . . -1.000
---- VAR y1 -INF . +INF -3.000
---- VAR y2 -INF . +INF 1.727
---- VAR y3 -INF . +INF 5.364
---- VAR y4 -INF -0.364 +INF .
---- VAR y5 -INF -0.909 +INF .
---- VAR z -INF 10.091 +INF .
0 INFEASIBLE
0 UNBOUNDED
7
Execution
---- 26 VARIABLE y1.L = 0.000
VARIABLE y2.L = 0.000
VARIABLE y3.L = 0.000
VARIABLE y4.L = -0.364

EN.NO:12102020503010
VARIABLE y5.L = -0.909
**** FILE SUMMARY
Q.9 Optimize the function for mixed nonlinear program (minlp) 75*(x1*x1) + 6*(x2*x2) +
3*(x3*x3) + 33*(x4*x4); for constraints 774*x1 + 76*(x2*x2) + 22*(x3*x3) +42*(x4*x4)
<875.
CODE:
Free Variable x1,x2,x3,x4,z;
Equations
Con1,
Con2,
Obj;
Con1.. 774*x1 + 76*(x2*x2) + 22*(x3*x3) +42*(x4*x4) =L=875;
Con2.. 67*(x1*x1) + 27*x2+ 79*x3 + 53*x4 =L=875;
Obj.. 75*(x1*x1) + 6*(x2*x2) + 3*(x3*x3) +33*(x4*x4) =E=z;
Model Ketan/
Con1,
EN.NO:12102020503010
Con2,
Obj/;
Solve Ketan using NLP minimizing z;
Display x1.L,x2.L,x3.L,x4.L,z.L;
SOLVE SUMMARY
TYPE NLP DIRECTION MINIMIZE
SOLVER CONOPT FROM LINE 20
**** MODEL STATUS 2 Locally Optimal
EVALUATION ERRORS 0 0
C O N O P T 3 version 3.17N
Copyright (C) ARKI Consulting and Development A/S
Bagsvaerdvej 246 A
DK-2880 Bagsvaerd, Denmark The model has 5
variables and 3 constraints with 13 Jacobian elements, 8 of
which are nonlinear. The Hessian of the Lagrangian has 4
elements on the diagonal,
0 elements below the diagonal, and 4 nonlinear variables.
** Warning ** The value of LFITER is out of range.
LFITER is decreased from 2147483647 to 1000000000.

EN.NO:12102020503010
** Warning ** The number of nonlinear derivatives equal to zero in the initial point is large (= 61
percent). A better initial point will probably help the optimization.
Pre-triangular equations: 0
Post-triangular equations: 1
** Optimal solution. Reduced gradient less than tolerance.
CONOPT time Total 0.041 seconds of
which: Function evaluations 0.002 = 4.9%
1st Derivative evaluations 0.001 = 2.4%
---- EQU Con1 -INF . 875.000 EPS
---- EQU Con2 -INF . 875.000 EPS
---- EQU Obj . . . -1.000
---- VAR x1 -INF . +INF .
---- VAR x2 -INF . +INF EPS
---- VAR x3 -INF . +INF EPS
---- VAR x4 -INF . +INF .
---- VAR z -INF . +INF .
0 INFEASIBLE
0 UNBOUNDED
0 ERRORS
7

Execution
---- 22 VARIABLE x1.L = 0.000
**** FILE SUMMARY
Q.10 Optimize the function of mixed integer where x1 is positive variable, x2 is integer and
x3 is binary variable x1+ x2+ x3; using constraints x1 - 2*x2 >7;X1 + 20*x3 > 9.
CODE:
Variable z;
Positive Variable x1,x2,x3;
Equations
Con1,
Con2,
Obj;
Con1.. x1 - 2*x2 =G=7;
Con2.. x1+20*x3 =G=9;
Obj.. x1+x2+x3 =E=z;
Model Ketan/
Con1,
EN.NO:12102020503010
Con2,
Obj/;
Solve Ketan using LP minimizing z;
SOLVE SUMMARY
TYPE LP DIRECTION MINIMIZE
--- Starting Cplex
Objective: 7.100000

EN.NO:12102020503010
---- EQU Con1 7.000 7.000 +INF 0.950
---- EQU Con2 9.000 9.000 +INF 0.050
---- EQU Obj . . . -1.000
LOWER LEVEL UPPER MARGINA
---- VAR z -INF 7.100 +INF .
---- VAR x1 . 7.000 +INF .
---- VAR x2 . . +INF 2.900 ----
VAR x3 . 0.100 +INF .
0 INFEASIBLE
0 UNBOUNDED
7
Execution
---- 23 VARIABLE x1.L = 7.000
USER: GAMS Demo license for VYOM JAVIA G230205|0002CO-GEN
**** FILE SUMMARY
Q.11 Optimize the function where, free variable z; positive variables x1,x2; integer variable
x3;functional variable z is X1*X1 + X2*X2 + X3*X3; constraints provided is 4*X1 +
X2*X2 + 2*X3=14. This is a mixed integral non liner program for maximizing z.
CODE:
Variable z;
Equations
Con1,
Obj;
Con1.. 4*x1+x2*x2+2*x3 =E=14;
Obj.. x1*x1+x2*x2+x3*x3 =E=z;
Model Ketan/
Con1,
Obj/;
Solve Ketan using MINLP maximizing z;
SOLVE SUMMARY
TYPE MINLP DIRECTION MAXIMIZE
SOLVER DICOPT FROM LINE 18
-------------------------------------------------------------------------------
EN.NO:12102020503010
Dicopt 2 41.5.0 2a5a4ddc Jan 3, 2023 WEI x86 64bit/MS Window
------------------------------------------------------------------------------
- by Aldo Vecchietti, Director del Instituto INGAR,
CONICET, UTN, Santa Fe, Argentina by Ignacio E. Grossmann,
Chemical Engineering Faculty,
Carnegie Mellon University, Pittsburgh, PA, USA
------------------------------------------------------------------------------- ***
This solver runs with a demo license. No commercial use.
Bagsvaerdvej 246 A

EN.NO:12102020503010
--- DICOPT: No discrete variables found
--- DICOPT: Returning NLP solution
The model does not contain any discrete variables.
The NLP solution is returned to GAMS.
Advice: use an NLP solver for this model.
---- EQU Con1 14.000 14.000 14.000 1.400
---- EQU Obj . . . -1.000
---- VAR z -INF 9.800 +INF .
---- VAR x1 . 2.800 +INF .
---- VAR x2 . . +INF EPS
---- VAR x3 . 1.400 +INF EPS
0 INFEASIBLE
0 UNBOUNDED
0 ERRORS
7
Execution
---- 20 VARIABLE x1.L = 2.800

EN.NO:12102020503010
**** FILE SUMMARY
Q.12 Optimize for minlp maximization of free variable z; where, integer variables
x1,x2,xn;and function being x1*x2*xn ; with constraints x1 + x2 +xn= 1.
CODE:
Variable z;
Positive Variable x1,x2,xn;
Equations
Con1,
Obj;
Con1.. x1+x2+xn =E=1;
Obj.. x1*x2*xn =E=z;
Model Ketan/
Con1,
Obj/;
Solve Ketan using MINLP maximizing z;
Display x1.L,x2.L,xn.L,z.L;
SOLVE SUMMARY

EN.NO:12102020503010
-------------------------------------------------------------------------------
------------------------------------------------------------------------------
------------------------------------------------------------------------------- ***
Bagsvaerdvej 246 A

EN.NO:12102020503010
Directional 2nd Derivative 0.002 = 2.3%
---- EQU Con1 1.000 1.000 1.000 0.111
---- EQU Obj . . . -1.000
---- VAR z -INF 0.037 +INF .
---- VAR x1 . 0.333 +INF .
---- VAR x2 . 0.333 +INF EPS
---- VAR xn . 0.333 +INF EPS
0 INFEASIBLE
0 UNBOUNDED
0 ERRORS
7G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
EN.NO:12102020503010
Execution
---- 20 VARIABLE x1.L = 0.333
VARIABLE xn.L = 0.333
**** FILE SUMMARY
Q.13 Optimize for minlp minimization of free variable z; where, integer variables
x1,x2; binary variable X3; Objective function being 4*x1*x1+ 2*x2*x2 +x3*x3 -4*x1*x2
; constraints are x1 + x2 +x3=15; and 2*x1 -x2 +2*x3=20 CODE:
Variable z;
Equations
Con1,
Con2,
Obj;
Con1.. x1 + x2 +x3 =E=15;
Con2.. 2*x1-x2+2*x3 =E=20;
Obj.. 4*x1*x1+ 2*x2*x2 +x3*x3 -4*x1*x2 =E=z;
Model Ketan/
Con1,
EN.NO:12102020503010
Con2,
Obj/;
Solve Ketan using MINLP minimizing z;
SOLVE SUMMARY
TYPE MINLP DIRECTION MINIMIZE
-------------------------------------------------------------------------------
------------------------------------------------------------------------------
------------------------------------------------------------------------------- ***
--- *** This solver runs with a demo license. No commercial use
EN.NO:12102020503010
Bagsvaerdvej 246 A
---- EQU Con1 15.000 15.000 15.000 4.444
---- EQU Con2 20.000 20.000 20.000 5.778
---- EQU Obj . . . -1.000

EN.NO:12102020503010
---- VAR z -INF 91.111 +INF .
---- VAR x1 . 3.667 +INF EPS
---- VAR x2 . 3.333 +INF .
---- VAR x3 . 8.000 +INF .
0 INFEASIBLE
0 UNBOUNDED
0 ERRORS
7
Execution
---- 23 VARIABLE x1.L = 3.667
**** FILE SUMMARY
Q.14 Run the following syntax of GAMS and find out whether its a lp, nlp, minlp, milp
problem and what is the maximized or minimized value.
(A) variable z; positive variables
x1,x2,x3,x4,x5,x6,x7,x8,x9,x10; equations
obj,a3,a5,a7,a8,a9,a11;
obj..z=e=2.17*x2+32*x4+13.96*x6+20.6*x7+3.66*x8+4.5*x10;
a3.. 1.65*x2=l=1700; a5.. 0.5*x4=l=780; a7.. 1.04*x6=l=5; a8..
0.98*x7=l=80; a9.. 0.36*x8=l=10; a11.. 1.6*x10=l=100; model
problem/all/; solve problem using lp maximizing z; S O L V E
SUMMARY
MODEL problem OBJECTIVE z
--- Starting Cplex
Objective: 54287.422280
EN.NO:12102020503010
---- EQU obj . . . 1.000
---- EQU a3 -INF 1700.000 1700.000 1.315
---- EQU a5 -INF 780.000 780.000 64.000
---- EQU a7 -INF 5.000 5.000 13.423
---- EQU a8 -INF 80.000 80.000 21.020
---- EQU a9 -INF 10.000 10.000 10.167
---- EQU a11 -INF 100.000 100.000 2.812
---- VAR z -INF 54287.422 +INF .
---- VAR x2 . 1030.303 +INF .
---- VAR x4 . 1560.000 +INF .
---- VAR x6 . 4.808 +INF .
---- VAR x7 . 81.633 +INF .
---- VAR x8 . 27.778 +INF .
---- VAR x10 . 62.500 +INF .
0 INFEASIBLE
0 UNBOUNDED
**** FILE SUMMARY
EN.NO:12102020503010
(B) positive variable x1 integer variable
x2; binary variable x3; variable obj;
equations objf , a1, a2; objf.. 7*x1-3*x2-
10*x3 =e= obj; a1.. x1-2*x2 =l=0; a2.. x1-
20*x3 =l=0; model problem/all/; solve
problem using minlp maximizing obj;
SOLVE SUMMARY
MODEL problem OBJECTIVE obj
EVALUATION ERRORS NA 0
-------------------------------------------------------------------------------
------------------------------------------------------------------------------

EN.NO:12102020503010
------------------------------------------------------------------------------
- *** This solver runs with a demo license. No commercial use.
--- DICOPT: No non-linearities found: executing the MIP solver
The model is linear (possibly with integer variables).
We will call the MIP solver to solve it for you.
Advice: use a MIP solver to solve this problem.
--- Starting Cplex
--- MIP status (101): integer optimal solution.
--- Fixing integer variables and solving final LP...
--- Fixed MIP status (1): optimal.
Proven optimal solution
MIP Solution: 100.000000 (0 iterations, 0 nodes)
Final Solve: 100.000000 (0 iterations)
Best possible: 100.000000
Absolute gap: 0.000000
Relative gap: 0.000000
---- EQU objf . . . -1.000

EN.NO:12102020503010
---- EQU a1 -INF . . 7.000
---- EQU a2 -INF . . .
---- VAR x1 . 20.000 +INF .
---- VAR x2 . 10.000 +INF 11.000
---- VAR x3 . 1.000 1.000 -10.000
---- VAR obj -INF 100.000 +INF .
0 INFEASIBLE
0 UNBOUNDED
0 ERRORS

EN.NO: 12102020503006
**** FILE SUMMARY

Lab5 Gams Formulation

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Lab5 Gams Formulation

Uploaded by

Copyright:

Available Formats

NAME: KETAN PATEL

Free Variable x1,x2,z;

Con1.. 2*x1+x2 =G=2;

Con2.. x1+3*x2 =L=3 ;

Obj.. 3*x1-x2 =E=z;

Solve Ketan using LP maximizing z;

TYPE LP DIRECTION MAXIMIZE

SOLVER CPLEX FROM LINE 24

**** SOLVER STATUS 1 Normal Completion

**** MODEL STATUS 3 Unbounded

**** OBJECTIVE VALUE 3.0000

RESOURCE USAGE, LIMIT 0.047 10000000000.000

ITERATION COUNT, LIMIT 1 2147483647

--- GMO setup time: 0.00s

--- GMO memory 0.50 Mb (peak 0.50 Mb)

--- Dictionary memory 0.00 Mb

--- Cplex 22.1.0.0 link memory 0.00 Mb (peak 0.00 Mb)

--- Starting Cplex

--- LP status (4): unbounded or infeasible.

--- Cplex Time: 0.02sec (det. 0.00 ticks)

*** WARNING: Presolve found the problem infeasible or unbounded ---

Rerunning with presolve turned off and solving with LPMETHOD=1.

--- LP status (2): unbounded.

--- Cplex Time: 0.03sec (det. 0.00 ticks)

Model has an unbounded ray

LOWER LEVEL UPPER MARGINAL ----

EQU Con1 2.000 2.000 +INF 1.500 NOPT

---- EQU Con2 -INF 1.000 3.000 .

---- EQU Con3 -INF . 4.000 .

LOWER LEVEL UPPER MARGINAL

---- VAR x1 -INF 1.000 +INF . ----

VAR x2 -INF . +INF -2.500 UNBND

---- VAR z -INF 3.000 +INF .

**** REPORT SUMMARY : 1 NONOPT ( NOPT)

General Algebraic Modeling System

---- 26 VARIABLE x1.L = 1.000

VARIABLE x2.L = 0.000

VARIABLE z.L = 3.000

EXECUTION TIME = 0.593 SECONDS 3 MB 41.5.0 2a5a4ddc WEX-WEI

USER: GAMS Demo license for Vyom javia G230205|0002CO-GEN

GH PATEL COLLEGE OF ENGINEERING AND TECHNOLOGY, India DL084667

**** FILE SUMMARY

Free Variable x1,x2,x3,z;

Con1.. 1*x1+x2 =G=0;

Con2.. -1*x1+2*x3 =L=0 ;

Con3.. x1+x2+x3 =L=100 ;

Obj.. 12*x1+15*x2+14*x3 =E=z;

Solve Ketan using LP maximizing z;

MODEL Ketan OBJECTIVE z

TYPE LP DIRECTION MAXIMIZE

SOLVER CPLEX FROM LINE 24

**** SOLVER STATUS 1 Normal Completion

**** MODEL STATUS 3 Unbounded

**** OBJECTIVE VALUE 1266.6667

RESOURCE USAGE, LIMIT 0.062 10000000000.000

ITERATION COUNT, LIMIT 2 2147483647

--- GMO setup time: 0.00s

--- GMO memory 0.50 Mb (peak 0.50 Mb)

--- Dictionary memory 0.00 Mb

--- Cplex 22.1.0.0 link memory 0.00 Mb (peak 0.00 Mb)

--- Starting Cplex

--- LP status (4): unbounded or infeasible.

--- Cplex Time: 0.00sec (det. 0.00 ticks)

*** WARNING: Presolve found the problem infeasible or unbounded ---

Con2.. -1x1+2x3 =L=0 ;

Obj.. 12x1+15x2+14*x3 =E=z;

Obj.. 2.17x2+32x4+13.96x6+20.6x7+3.66x8+4.5x10 =E=z;