**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Lecture# Optimization Problems: Path Finding and Portfolio Allocation

Description

This lecture covers optimization problems related to finding the fastest path between two points with different terrains and speeds, as well as formulating a portfolio allocation problem to minimize cost while meeting return and covariance constraints. It also delves into linear programming problems, convex functions, and the concept of extreme points in polyhedrons.

Official source

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

In course

MGT-483: Optimal decision making

This course introduces the theory and applications of optimization. We develop tools and concepts of optimization and decision analysis that enable managers in manufacturing, service operations, marke

Instructor

Related concepts (178)

Convex optimization

Convex optimization is a subfield of mathematical optimization that studies the problem of minimizing convex functions over convex sets (or, equivalently, maximizing concave functions over convex sets). Many classes of convex optimization problems admit polynomial-time algorithms, whereas mathematical optimization is in general NP-hard.

Feasible region

In mathematical optimization, a feasible region, feasible set, search space, or solution space is the set of all possible points (sets of values of the choice variables) of an optimization problem that satisfy the problem's constraints, potentially including inequalities, equalities, and integer constraints. This is the initial set of candidate solutions to the problem, before the set of candidates has been narrowed down.

Linear programming

Linear programming (LP), also called linear optimization, is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements are represented by linear relationships. Linear programming is a special case of mathematical programming (also known as mathematical optimization). More formally, linear programming is a technique for the optimization of a linear objective function, subject to linear equality and linear inequality constraints.

Optimization problem

In mathematics, computer science and economics, an optimization problem is the problem of finding the best solution from all feasible solutions. Optimization problems can be divided into two categories, depending on whether the variables are continuous or discrete: An optimization problem with discrete variables is known as a discrete optimization, in which an object such as an integer, permutation or graph must be found from a countable set.

Duality (optimization)

In mathematical optimization theory, duality or the duality principle is the principle that optimization problems may be viewed from either of two perspectives, the primal problem or the dual problem. If the primal is a minimization problem then the dual is a maximization problem (and vice versa). Any feasible solution to the primal (minimization) problem is at least as large as any feasible solution to the dual (maximization) problem.

Related lectures (768)

Optimization Programs: Piecewise Linear Cost FunctionsMGT-483: Optimal decision making

Covers the formulation of optimization programs for minimizing piecewise linear cost functions.

Optimization Methods: Theory DiscussionME-454: Modelling and optimization of energy systems

Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.

Optimal Decision Making: Sensitivity AnalysisMGT-483: Optimal decision making

Covers sensitivity analysis in linear programming, focusing on optimal solutions and their sensitivities to changes.

Optimization with Constraints: KKT ConditionsMATH-212: Analyse numérique et optimisation

Covers the KKT conditions for optimization with constraints, essential for solving constrained optimization problems efficiently.

Optimization Methods in Machine LearningCS-433: Machine learning

Explores optimization methods in machine learning, emphasizing gradients, costs, and computational efforts for efficient model training.