✦ScienexySCIENCE KNOWLEDGE LIBRARY
reference · SCI-MAT-013-002

Meaning and Definition of Optimization

Optimization means selecting the best available alternative according to a measurable objective while respecting the conditions of a problem.

  • x* = arg minₓ f(x)

  • x* = arg maxₓ f(x)

  • f(x*) ≤ f(x) for all feasible x in a minimization problem

Explanation

The word optimization refers to the process of making something as effective, efficient, or suitable as possible. In mathematics, this idea is expressed through an objective function whose value depends on one or more variables. Optimization searches for variable values that produce the smallest or largest possible objective value within a specified domain. The word best must always be interpreted in relation to the chosen objective. For example, the cheapest design may not be the strongest design, and the fastest route may not be the safest route. Mathematical optimization makes these priorities explicit. A problem may have no feasible solution, one optimal solution, or several solutions with the same optimal value. Some problems have a finite optimum, while others may be unbounded.

Variables

  • x: candidate decision vector

  • x*: optimal decision vector

  • f(x): objective function

  • arg min: input value that produces the minimum objective value

  • arg max: input value that produces the maximum objective value

Example or application

A delivery company may want to minimize the total distance travelled by its vehicles. The routes are the decision variables, and total distance is the objective. The best route combination is the one with the smallest distance while satisfying delivery requirements.

Definition

Optimization is the process of finding an admissible point in a specified domain at which an objective function reaches its minimum or maximum value.

Purpose

The purpose is to express the idea of the best decision precisely enough that it can be analyzed, compared, and solved mathematically.

Importance

A precise definition prevents confusion between improving a system generally and optimizing a specific measurable objective. It also clarifies what counts as a valid and best solution.

Learning Objectives

  • Define optimization mathematically and conceptually.

  • Explain the difference between a decision and an objective.

  • Interpret minimum and maximum objective values.

  • Understand the role of a feasible domain.

  • Recognize that the meaning of best depends on the chosen criterion.

Key Concepts

  • Objective value

  • Decision space

  • Feasible domain

  • Minimum

  • Maximum

  • Argmin

  • Argmax

Working Principle

A mathematical optimization problem defines a set of allowed decisions and assigns an objective value to each decision. The optimization task compares these values and identifies a feasible decision with the required extreme value.

Process

  • Define the quantity that represents success.

  • Specify the possible decision values.

  • Identify which decisions are permitted.

  • Evaluate or compare the objective values.

  • Select a feasible decision with the best objective value.

  • Check whether the optimum is unique, multiple, or nonexistent.

Applications

  • Minimizing manufacturing costs

  • Maximizing business revenue

  • Reducing energy consumption

  • Improving network performance

  • Selecting efficient transportation routes

Worked Example

Consider f(x) = (x − 3)² for real x. Since a square cannot be negative, f(x) ≥ 0. At x = 3, f(3) = 0. Therefore, the global minimum is 0, achieved at x* = 3. The notation arg minₓ f(x) = 3 identifies the input that produces this minimum.

Common Misconceptions

  • Optimization does not mean making every feature better simultaneously.

  • The smallest input is not necessarily the input that minimizes a function.

  • The optimal decision and the optimal objective value are different mathematical objects.

  • A local improvement does not automatically establish a global optimum.

Practice Questions

  • Define optimization using the concept of an objective function.

  • What is the difference between argmin and the minimum value?

  • Find the minimum of f(x) = (x − 5)².

  • Why must the feasible domain be specified?

  • Can two different decisions produce the same optimal value?

Key Takeaway

Optimization is the mathematical search for an extreme objective value over an explicitly defined set of permitted decisions.

Prerequisites

  • Functions

  • Basic algebra

  • Inequalities

Reference

  • Bertsimas, D., and Tsitsiklis, J. N. Introduction to Linear Optimization.

  • Boyd, S., and Vandenberghe, L. Convex Optimization.

Related Topics

  • Introduction to Optimization

  • Objective Functions

  • Feasible and Infeasible Regions

  • Optimal Solutions

  • Local and Global Optima

Sources and verification

Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.

  • Source verification pending; check an authoritative textbook, university, standards body, or peer-reviewed source.

Suggest a correction or source · More in Optimization & Operations Research