
Before you start this module please have quick look at this video
In this lecture, you will become familiar with the optimization elements
Objective function
Constraints
Data
You will learn how to download and install the GAMS
By this lecture you will learn more about the structure of GAMS
This gives you a big picture of what you can do with GAMS and how GAMS does the optimisation
What is Table?
How to deal with Tables in GAMS ?
Syntax ?
What is Scalar?
How to deal with Scalars in GAMS ?
Syntax ?
What is Table?
How to deal with Tables in GAMS ?
Syntax ?
How to define equations in GAMS?
What is the syntax ?
What kind of optimisation models can be solved in GAMS ?
What is my model type ?
How to select the appropriate GAMS solver for my model ?
The conditional statement is explained in this lecture
The loop statement is explained in this lecture
Multi-objective optimisation is explained and coded in GAMS
Linear programming is explained and some examples are solved
Mixed Integer Programming is explained and coded in this lecture
In a given circle find a rectangle of maximal area.
In a given sphere find a cylinder of maximal volume
“A woman at a point A on the shore of a circular lake with radius 2 mi wants to arrive at the point C diametrically opposite A on the other side of the lake in the shortest possible time (see the figure). She can walk at the rate of 4 mi/h and row a boat at 2 mi/h. For what value of the angle θ shown in the figure will she minimize her travel time?“
(Steiner) In the plane of a triangle, find a point such that the sum of its distances to the vertices of the triangle is minimal.
A and B are two given points on the same side of a line ℓ. Find a point D on ℓ such that the sum of the distances form A to D and from D to B is a minimum.
In this lecture you will learn how to code in GAMS for finding the shortest paths between nodes in a graph, which may represent, for example, road networks.
The travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?"
Each city should be met only once
Every city should be visited
The developed course is suitable for you even if you have no background in programming. The course is devoted to general optimization problems in GAMS.
In this course, you will learn how to use GAMS for solving optimization problems.
First of all, you will learn how to install GAMS on your machine.
What is optimization? What is the objective function? What is the constraint?
You understand the meaning of different errors and the way you should debug them
How to read/write from/to an Excel file
Multi-Objective optimization in GAMS
How to code conditional statements in GAMS
How to code Loop statements in GAMS