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

Maximization and Minimization Problems

Maximization problems seek the largest possible objective value, while minimization problems seek the smallest possible objective value within the feasible set.

  • Maximize Z = f(x), subject to x ∈ S

  • Minimize C = g(x), subject to x ∈ S

  • Minimize f(x) is equivalent to maximize −f(x), over the same feasible set.

Explanation

Maximization and minimization are the two fundamental directions of mathematical optimization. A maximization problem aims to increase a quantity such as profit, output, efficiency, or service coverage. A minimization problem aims to reduce a quantity such as cost, distance, time, energy consumption, or error. Both problem types use decision variables and may include constraints. The distinction is expressed mathematically through the direction of the objective function. Some mathematical problems can be converted between minimization and maximization by changing the sign of the objective function. However, the interpretation of the result must remain consistent with the original real-world goal. Choosing the wrong direction can produce a solution that is mathematically valid but operationally undesirable.

Variables

  • x: decision variables

  • f(x): objective function

  • Z: maximization objective value

  • C: minimization objective value

  • S: feasible set

Example or application

A company may want to maximize its profit while a delivery service wants to minimize total travel distance. Both are optimization problems, but their objective directions are different.

Definition

A maximization problem seeks a feasible decision that produces the greatest objective value, whereas a minimization problem seeks one that produces the smallest objective value.

Purpose

The purpose is to define the direction in which a decision should improve the objective function.

Importance

Correctly identifying the objective direction is essential for selecting a suitable optimization model and interpreting its solution.

Learning Objectives

  • Explain maximization and minimization.

  • Identify the appropriate direction for a given objective.

  • Write simple maximization and minimization models.

  • Understand sign conversion between the two forms.

  • Interpret objective values in practical contexts.

Key Concepts

  • Maximization

  • Minimization

  • Objective direction

  • Maximum value

  • Minimum value

  • Sign transformation

Working Principle

The model defines a measurable objective and determines whether larger or smaller values are preferred. An optimization method then searches the feasible set in the selected direction.

Process

  • Identify what the decision-maker wants to improve.

  • Determine whether improvement means increasing or decreasing a quantity.

  • Define the corresponding objective function.

  • Specify all constraints.

  • Select a suitable solution method.

  • Interpret the resulting optimum in the original problem context.

Applications

  • Profit maximization

  • Cost minimization

  • Travel-time reduction

  • Energy-efficiency improvement

  • Waste minimization

Worked Example

Consider the feasible interval 0 ≤ x ≤ 5. If f(x) = 2x + 1 is to be maximized, the maximum occurs at x = 5, giving f(5) = 11. If the same function is to be minimized, the minimum occurs at x = 0, giving f(0) = 1. The feasible set is unchanged, but the optimal decision depends on the objective direction.

Common Misconceptions

  • Maximization is not always preferable to minimization; the objective determines the direction.

  • The largest decision-variable value does not necessarily maximize the objective.

  • Changing the sign of an objective changes its direction but does not change the feasible set.

  • A minimization problem can have an unbounded objective just as a maximization problem can.

Practice Questions

  • Give three examples of maximization problems.

  • Give three examples of minimization problems.

  • Convert minimizing f(x) into an equivalent maximization objective.

  • For f(x) = 5x over 1 ≤ x ≤ 4, find its minimum and maximum.

  • Why must the objective direction be clear before solving a model?

Key Takeaway

Maximization and minimization differ in the direction of improvement, but both follow the same fundamental optimization framework.

Prerequisites

  • Objective Functions

  • Constraints and Feasible Solutions

  • Basic inequalities

Reference

  • Taha, H. A. Operations Research: An Introduction.

  • Hillier, F. S., and Lieberman, G. J. Introduction to Operations Research.

Related Topics

  • Objective Functions

  • Optimal Solutions

  • Local and Global Optima

  • Continuous and Discrete Optimization

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