Question

coding Revised Simplex including 2-phase method and graphical user interface for solving LP problems. You can code in Python, Java, C++, or C# I request this questions's solution by code as instructed. Find the following linear programming by two phase method: Minimize z = 5x+2y subject to 2x + 3y > 75 4x + y = 80 x, y = 0

Answer 1

Please give positive ratings for my effort. Thanks.

GRAPH

Feasible region 100 0 60 y 40 20 -20 -10 0 10 20 30 40 50 X

PROGRAM

import pulp as p

Lp_prob = p.LpProblem('Problem', p.LpMinimize)

x = p.LpVariable("x", lowBound = 0)
y = p.LpVariable("y", lowBound = 0)

Lp_prob += 5*x + 2*y

Lp_prob += 2*x + 3*y >= 75
Lp_prob += 4*x + y >= 80
Lp_prob += x >= 0
Lp_prob += y >= 0

print(Lp_prob)

status = Lp_prob.solve() # Solver
print(p.LpStatus[status]) # The solution status

# Printing the final solution
print(p.value(x), p.value(y), p.value(Lp_prob.objective))

IMAGE OF PROGRAM

Run Debug Stop Share M Save {} Beautify x = main.py i import pulp as p 2 3 Lp_prob p.LpProblem("Problem', p.LpMinimize) 4 5 p.LpVariable("x", lowBound ) 6 y p.LpVariable("y", lowBound - ) 7 8 Lp_prob += 5 x + 2*y 9 10 Lp_prob += 2*x + 3*y >= 75 11 Lp_prob += 4*x + y >= 80 12 Lp_prob += x >= 13 Lp_prob += y >= 0 14 15 print(Lp_prob) 16 17 status = Lp_prob.solve() # Solver 18 print (p.LpStatus[status]) # The solution status 19 20 # Printing the final solution 21 print(p.value(x), p.value(y), p.value(Lp_prob.objective))

IMAGE OF OUTPUT

Status Successfully executed Date 2020-05-31 14:53:07 Output 16.5 14 110.5