Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

The Transhipment Problem: Optimality Conditions

Description

This lecture covers the transhipment problem in standard form, Lagrangian optimization, first-order optimality conditions (KKT), and complementarity slackness. It explains the optimality conditions required for solving transhipment problems efficiently.

In MOOC

Optimization: principles and algorithms - Network and discrete optimization

Official source

Related concepts (7)

Optimal control

Optimal control theory is a branch of mathematical optimization that deals with finding a control for a dynamical system over a period of time such that an objective function is optimized. It has numerous applications in science, engineering and operations research. For example, the dynamical system might be a spacecraft with controls corresponding to rocket thrusters, and the objective might be to reach the moon with minimum fuel expenditure.

Mathematical optimization

Mathematical optimization (alternatively spelled optimisation) or mathematical programming is the selection of a best element, with regard to some criterion, from some set of available alternatives. It is generally divided into two subfields: discrete optimization and continuous optimization. Optimization problems arise in all quantitative disciplines from computer science and engineering to operations research and economics, and the development of solution methods has been of interest in mathematics for centuries.

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.

Lagrange multiplier

In mathematical optimization, the method of Lagrange multipliers is a strategy for finding the local maxima and minima of a function subject to equation constraints (i.e., subject to the condition that one or more equations have to be satisfied exactly by the chosen values of the variables). It is named after the mathematician Joseph-Louis Lagrange. The basic idea is to convert a constrained problem into a form such that the derivative test of an unconstrained problem can still be applied.

Bellman equation

A Bellman equation, named after Richard E. Bellman, is a necessary condition for optimality associated with the mathematical optimization method known as dynamic programming. It writes the "value" of a decision problem at a certain point in time in terms of the payoff from some initial choices and the "value" of the remaining decision problem that results from those initial choices. This breaks a dynamic optimization problem into a sequence of simpler subproblems, as Bellman's “principle of optimality" prescribes.

Related lectures (34)

Primal-dual Optimization II

Explores primal-dual optimization methods, focusing on Lagrangian approaches and various methods like penalty, augmented Lagrangian, and splitting techniques.

Primal-dual optimization: Theory and Computation

Explores primal-dual optimization, conjugation of functions, strong duality, and quadratic penalty methods in data mathematics.

Primal-dual Optimization III: Lagrangian Gradient Methods

Explores primal-dual optimization methods, emphasizing Lagrangian gradient techniques and their applications in data optimization.

Asset Pricing and Hedging in Complete Markets

Covers asset pricing, hedging, American claims, stopping times, and dynamic programming in finance.

Optimality Conditions in Linear Optimization MOOC: Optimization: principles and algorithms - Linear optimization