0% found this document useful (0 votes)
23 views4 pages

Punto 2: Juan Pablo Gonzalez Hoyos

The document describes two optimization problems modeled with linear programming. The first problem involves maximizing profit from selecting products given weight and volume constraints. The second problem involves minimizing production costs given demand and capacity constraints.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
23 views4 pages

Punto 2: Juan Pablo Gonzalez Hoyos

The document describes two optimization problems modeled with linear programming. The first problem involves maximizing profit from selecting products given weight and volume constraints. The second problem involves minimizing production costs given demand and capacity constraints.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

JUAN PABLO GONZALEZ HOYOS

PUNTO 2

reset;
model;

#var de decision
var y1 binary;
var y2 binary;
var y3 binary;
var x1>=0, integer;
var x2>=0, integer;
var x3>=0, integer;

#FUNCION OBJETIVO
minimize costoproducc:
300*y1 +100*y2 +200*y3 +2*x1 +10*x2 +5*x3;

#RESTRICCIONES
subject to r1:
x1 + x2 + x3 >= 2000;

subject to r2:
x1 >= 500*y1;

subject to r3:
x2 >= 500*y2;

subject to r4:
x3 >= 500*y3;

subject to r5:
x1 <= 600*y1;

subject to r6:
x2 <= 800*y2;

subject to r7:
x3 <= 1200*y3;

option solver cplex;


solve costoproducc;
display costoproducc, x1, x2, x3, y1, y2, y3;
JUAN PABLO GONZALEZ HOYOS

PUNTO 1
reset;
model;

set Prod;
param peso_max >=0;
param volumen_max >=0;

param peso(Prod) >=0;


param volumen(Prod) >=0;
param valor(Prod) >=0;

var X(Prod) >=0 integer;

maximize Ganancia:
sum(i in Prod) valor[i]*X[i];

s.t. Peso_Ocupado:
sum(i in Prod) peso[i]*X[i] <= peso_max;

s.t. Volumen_Ocupado:
sum(i in Prod) volumen[i]*X[i] <= volumen_max;

data;

param P:= 1 2 3 4 5;
param peso_max:= 120;
param volumen_max:= 120;

param peso:=
1 5
2 8
3 3
4 2
5 7
6 3
7 4;

param volumen:=
1 1
2 8
3 6
4 5
5 4
6 3
7 2;

param valor:=
JUAN PABLO GONZALEZ HOYOS

1 4
2 7
3 6
4 5
5 4
6 5
7 4;

option solver cplex;


solve Ganancia;
display Ganancia, X;
JUAN PABLO GONZALEZ HOYOS

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy