This document contains code snippets demonstrating various linear algebra and optimization problems in Python. It shows how to plot functions, generate 3D surface plots, perform rotations and reflections of geometric objects, check if points are collinear, solve linear programming problems, and find optimal solutions.
This document contains code snippets demonstrating various linear algebra and optimization problems in Python. It shows how to plot functions, generate 3D surface plots, perform rotations and reflections of geometric objects, check if points are collinear, solve linear programming problems, and find optimal solutions.
This document contains code snippets demonstrating various linear algebra and optimization problems in Python. It shows how to plot functions, generate 3D surface plots, perform rotations and reflections of geometric objects, check if points are collinear, solve linear programming problems, and find optimal solutions.
This document contains code snippets demonstrating various linear algebra and optimization problems in Python. It shows how to plot functions, generate 3D surface plots, perform rotations and reflections of geometric objects, check if points are collinear, solve linear programming problems, and find optimal solutions.
In [3]: #Q1)Plot the graph of f(x) = x^4 in [0,5] with red dashed line with circle import numpy as np import matplotlib.pyplot as plt def f(x): return x**4 x_values = np.linspace(0, 5, num=1000) y_values = f(x_values) plt.plot(x_values, y_values, 'r--', marker='o') plt.title('Graph of f(x) = x^4') plt.xlabel('x') plt.ylabel('y') plt.show()
In [9]: #Q5) Using python declare the points P(5,2),Q(5,-2),R(5,0) check whether th # collinear.Declare the ray passing through the points P and Q find the len # between P and Q. Also find slope of this ray.
import math # Define the coordinates of the points P, Q, and R P = (5, 2) Q = (5, -2) R = (5, 0) # Check if the points P, Q, and R are collinear if (Q[1]-P[1])*(R[0]-Q[0]) == (R[1]-Q[1])*(Q[0]-P[0]): print("The points P, Q, and R are collinear.") else: print("The points P, Q, and R are not collinear.") # Define the ray passing through P and Q ray_direction = (Q[0]-P[0], Q[1]-P[1]) # Find the length of the ray between P and Q ray_length = math.sqrt(ray_direction[0]**2 + ray_direction[1]**2) # Find the slope of the ray if ray_direction[0] != 0: slope = ray_direction[1] / ray_direction[0] else: slope = float('inf') # Print the length and slope of the ray print("The length of the ray between P and Q is", ray_length) print("The slope of the ray is", slope)
The points P, Q, and R are collinear.
The length of the ray between P and Q is 4.0 The slope of the ray is inf
In [10]: #Q6) write a python program in 3D to rotate the point (1,0,0) through X pla # in anticlock wise direction(rotation through Z axis) by angle of 90
point = np.array([1, 0, 0])
theta = np.radians(90) rotation_matrix = np.array([[np.cos(theta), -np.sin(theta), 0], [np.sin(theta), np.cos(theta), 0], [0, 0, 1]]) new_point = np.dot(rotation_matrix, point) print("The original point was:", point) print("The rotated point is:", new_point)
The original point was: [1 0 0]
The rotated point is: [6.123234e-17 1.000000e+00 0.000000e+00]
In [13]: #Q7) Write a python program to solve the following LPP :
Min Z=3.5x+2y Subject to x+y≥5 x≥4 y≤2 x,y≥0
from pulp import *
prob = LpProblem("LP Problem", LpMinimize) x = LpVariable("x", lowBound=0) y = LpVariable("y", lowBound=0) prob += 3.5*x + 2*y prob += x + y >= 5 prob += x >= 4 prob += y <= 2 prob.solve() print("Status: ", LpStatus[prob.status]) print("Optimal values:") for v in prob.variables(): print(v.name, "=", v.varValue) print("Optimal objective value: ", value(prob.objective))
Status: Optimal Optimal values: x = 4.0 y = 1.0 Optimal objective value: 16.0
In [15]: #Q8) Write a python program to display the following LPP by using pulp module and simplex method.Find its optimal solution if exist Max Z=x+2y+z Subject to x+2y+2z ≤ 1 3x+2y+z ≥ 8 X,y,x ≥ 0
from pulp import *
prob = LpProblem("LP Problem", LpMaximize) x = LpVariable("x", lowBound=0) y = LpVariable("y", lowBound=0) z = LpVariable("z", lowBound=0) prob += x + 2*y + z prob += x + 2*y + 2*z <= 1 prob += 3*x + 2*y + z >= 8 prob.solve() print("Status: ", LpStatus[prob.status]) print("Optimal values:") for v in prob.variables(): print(v.name, "=", v.varValue) print("Optimal objective value: ", value(prob.objective))
Status: Infeasible Optimal values: x = 2.6666667 y = 0.0 z = 0.0 Optimal objective value: 2.6666667
In [16]: #Q9) Apply Python program in each of the following transformation on the point P[4,-2] A ) Reflection through the Y-axis B) Scaling in X-coordinate by factor 3 C ) Rotation about origin through an angle π D ) Shearing in both X and Y direction by -2 and 4 units respectively
import numpy as np P = np.array([4, -2]) P_reflect_y = np.array([-4, 2]) print("Reflection through Y-axis:", P_reflect_y) P_scale_x = np.array([12, -2]) print("Scaling in X-coordinate by factor 3:", P_scale_x) theta = np.pi rot_matrix = np.array([[np.cos(theta), -np.sin(theta)], [np.sin(theta), np.cos(theta)]]) P_rotate = rot_matrix.dot(P) print("Rotation about origin through an angle π:", P_rotate) shear_matrix = np.array([[1, -2], [4, 1]]) P_shear = shear_matrix.dot(P) print("Shearing in both X and Y direction by -2 and 4 units respectively:"
Reflection through Y-axis: [-4 2]
Scaling in X-coordinate by factor 3: [12 -2] Rotation about origin through an angle π: [-4. 2.] Shearing in both X and Y direction by -2 and 4 units respectively: [ 8 14]
In [18]: #Q10) Find the combined transformation of the line segment between the poin A[4,-1] & B[3,2] by using python program for the following sequence of transformation i)Rotation about origin through an angle 𝝅/4 ii) Shering in Y direction by 4 units iii) Scaling in X-coordinate by 5 units iv) reflection through Y-axis
