Optimisasi

2022 :

2021 : Catatan Kuliah MA3071


2021 Workshop Pengenalan Optimisasi Jaringan dengan Python

Comments

Post a Comment

Popular posts from this blog

Spiral Dynamics Optimization

Image
Spiral Dynamics Inspired Optimization ¶ Kenichi Tamura and Keiichiro Yasuda ¶ https://doi.org/10.20965/jaciii.2011.p1116 ¶ Ilustration ¶ In [1]: import math import numpy as np import copy import random import time import datetime import itertools import matplotlib.pyplot as plt from mpl_toolkits.mplot3d import Axes3D Rotation Model ¶ Rotation 2D ¶ In [2]: def x_rotate ( x , radius = 0.95 , theta = math . pi / 3 ): rotate_m = radius * np . array ([[ math . cos ( theta ), - math . sin ( theta )],[ math . sin ( theta ), math . cos ( theta )]]) return rotate_m @x def xvec_rotate ( xvec , center = [ 0 , 0 ], n = 10 , radius = 0.95 , theta =- math . pi / 3 ): rotate_m = radius * np . array ([[ math . co...
Read more

Contoh Fungsi : Sudut 2 Vektor

Membuat Fungsi Pada Python ¶ Pada tulisan ini, akan diberikan contoh pembuatan/penggunaan fungsi. Kasus yang digunakan adalah sudut antara 2 vektor Sudut Antara 2 Vektor ¶ Misalkan vektor $\bar{u}=\begin{bmatrix}u_1\\u_2\\\vdots\\u_n\end{bmatrix}$ dan $\bar{v}=\begin{bmatrix}v_1\\v_2\\\vdots\\v_n\end{bmatrix}$. Sudut terkecil yang dibentuk oleh vektor tersebut adalah $\theta$, dengan $$\theta=\cos^{-1}\left(\frac{\bar{u}\cdot\bar{v}}{|\bar{u}|\ |\bar{v}|}\right)$$ Perkalian dot vektor antara $\bar{u}$ dan $\bar{v}$ didefinisikan sebagai $$\bar{u}\cdot\bar{v}=u_1v_1+u_2v_2+...+u_nv_n$$ Panjang vektor $\bar{u}$ didefinisikan sebagai $$|\bar{u}|=\sqrt{u_1^2+u_2^2+...+u_n^2}$$ Algoritma menghitung sudut antara 2 vektor Deskripsi : Algoritma menghitung sudut antara 2 vektor Masukkan : masukkan ukuran vektor $n$, masukkan 2 vektor Keluaran : sudut terkecil antara 2 vektor Langkah-langkah : masukkan ukuran vektor $...
Read more

Sudoku with IP

Table of Contents 1   Solving Sudoku with Integer Programming 2   Solve using MIP 3   Solve using Gurobi Solving Sudoku with Integer Programming ¶ Sudoku is played on a grid of 9 x 9 spaces. Within the rows and columns are 9 “squares” (made up of 3 x 3 spaces). Each row, column and square (9 spaces each) needs to be filled out with the numbers 1-9, without repeating any numbers within the row, column or square. https://sudoku.com/how-to-play/sudoku-rules-for-complete-beginners/ Basic sudoku has size 9 x 9 with number 1-9 as the filling. However, the size and the filling can be changed. Solve sudoku with Integer Programming Define : $N$ is a set of sudoku filling $N=[1,2,3,4,5,6,7,8,9]$ $N=[$a,b,c,d,e,f,g,h,i,j$]$ $N=[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16]$ etc $R$ is a set of sudoku row $R=[1,2,3,4,5,6,7,8,9]$ etc $C$ is a set of sudoku columns $C=[1,2,3,4,5,6,7,8,9]$ etc...
Read more

Contoh Program Linear di Python & R

Contoh Program Linear dengan Python dan R ¶ Catatan kuliah MA3071 20210920 Diberikan masalah program linear sebagai berikut : Minimumkan $z=-2x_1-3x_2$ Terhadap kendala : $x_1+2x_2\leq 12$ $2x_1+x_2\leq 9$ $4x_1+3x_2\leq 35$ $x_1,x_2\geq 0$ Penyelesaian dengan metode simplex sudah dipelajari di kelas Selesaikan dengan Python ¶ In [1]: import numpy as np from scipy.optimize import linprog ## Kendala harus dalam bentuk Ax<=b #Maktriks kendala A = np . array ([[ 1 , 2 ], [ 2 , 1 ], [ 4 , 3 ]]) #Koefisien ruas kanan b = np . array ([ 12 , 9 , 35 ]) #Koefisien fungsi objektif (cost) c = np . array ([ - 2 , - 3 ]) #Selesaikan masalah program linear res = linprog ( c , A_ub = A , b_ub = b ) print ( res ) con: array([], dtype=float64) fun: -18.999999910103906 message: 'Optimization terminated successfully.' nit...
Read more