The University of Manchester · FACULTY OF MATHEMATICS

ECON10071 Chap.5 Feasible Sets and Types of Optimum

- one subject, every graph, every model, every mark
6 Chapters2-page Bible
Our own words - no uploaded lecturer files
Updated for this semester
Chapter 5 of 12 · ECON10071

Feasible Sets and Types of Optimum

Feasible Sets and Types of Optimum separate admissible choices from attractive but impossible ones. Every candidate must satisfy all equality, inequality and non-negativity restrictions. Binding constraints hold with equality; slack constraints do not. Interior and boundary describe a point's location in the feasible set, while local and global describe the comparison range used to establish optimality.

A boundary may arise from non-negativity even when a budget restriction is slack.

In this chapter

What this chapter covers

  • 01

    Objective and choice variables

  • 02

    Feasible sets

  • 03

    Binding and slack constraints

  • 04

    Interior and boundary points

  • 05

    Local and global maxima

  • 06

    Existence of optima

Worked example · free

Classify points in a budget set

Q [6 marks]. For the set with x and y nonnegative and 3x+y no greater than 12, classify (2,3), (0,5) and (4,2). Marks shown for this feasibility comparison structure self-checking and are not an official university marking scheme.
The shaded triangle is the feasible set: one point is interior, one lies on a boundary, and the red point violates the constraints.The shaded triangle is the feasible set: one point is interior, one lies on a boundary, and the red point violates the constraints.interiorboundaryinfeasiblechoice xchoice y
The shaded triangle is the feasible set: one point is interior, one lies on a boundary, and the red point violates the constraints.
  • 4The first point spends 9 with both coordinates positive, so it is interior; the second has x=0 and is a boundary point with slack expenditure.
  • 2The third spends 14 and is infeasible.
The classifications are interior, boundary and infeasible. The marks are original practice weighting.
Sia tip — Name the constraint that creates the boundary rather than assuming the main resource restriction binds.
Glossary

Key terms

Feasible point
A choice that satisfies every restriction in the problem.
Binding constraint
An inequality restriction that holds with equality at a point.
Global maximum
A feasible point whose objective value is at least as high as every feasible alternative.
FAQ

Feasible Sets and Types of Optimum FAQ

Can a boundary point have slack expenditure?

Yes. A non-negativity restriction can bind while the resource inequality remains strict. Boundary status refers to the edge of the entire feasible set, not only to the most prominent budget line.

How is a local maximum different from a global one?

A local maximum dominates nearby feasible choices, while a global maximum dominates every feasible choice. A local comparison cannot support a global claim unless another argument controls the rest of the feasible set.

Why check existence before solving conditions?

First-order equations can produce candidates even when the objective is unbounded or the feasible set is empty. A sketch, compactness argument or direct bound shows whether an optimum can actually be attained.

Study strategy

Exam move

Translate every verbal restriction into an equation or inequality and sketch the feasible set before optimising. At each candidate, record feasibility, interior or boundary status and every binding restriction. Keep the maximiser point separate from the maximum value. When claiming global optimality, identify the comparison or bounding argument that covers the entire feasible set. Begin with a constraint ledger.

Give every restriction a name, write its mathematical form and record which side of the boundary is admissible. Include non-negativity rather than treating it as background. Test one obvious point, such as the origin when allowed, to confirm the shaded side of each line. Intersect the restrictions and list the resulting vertices, open edges or unbounded directions.

This sketch is a logical map: it reveals whether the feasible set is empty, bounded, closed or capable of supporting movements that make the objective grow without limit. For every proposed point, calculate each constraint residual. State feasible or infeasible first, then identify whether each inequality binds or has slack.

A point can lie on the boundary because x=0 even when a resource constraint has unused capacity, so name the particular restriction that creates the boundary. Use a small table with one row per candidate and one column per constraint. That table makes it difficult to compare objective values at an inadmissible point or to call a slack budget binding merely because another restriction is active.

Practise the language of optimality with contrast examples. A local maximum only beats feasible points in some neighbourhood, whereas a global maximum beats every feasible point. Construct a two-peak function to see how the claims differ. Keep the maximiser, which is an input point, separate from the maximum, which is the attained objective value.

When an exercise asks for existence, explain why continuity plus a compact feasible set is useful, or examine an unbounded or open set directly. A stationary candidate cannot substitute for an existence argument. In timed work, use the order feasibility, location, candidates, values and proof. Check boundary branches before accepting an interior first-order solution.

For a linear objective on a polygon, compare vertices and consider any edge parallel to the objective contours. For a nonlinear objective, use curvature, substitution or an explicit bound suited to the function. Close by matching the strength of the evidence to the wording: a nearby comparison supports a local claim, while complete candidate comparison or a domain-wide bound can support a global claim.

Review mistakes by locating the failed stage. An infeasible point signals a constraint or arithmetic error. A missing boundary candidate signals incomplete case generation. A correct candidate with an unsupported label signals a classification gap. A confused maximum value and maximiser signals a reporting error.

Rework one new problem that targets the same stage, then explain why the corrected reasoning covers the relevant comparison set. This diagnostic approach is more effective than repeating a full solution without knowing which decision caused the failure. Build one blank candidate table before each timed set and fill it during the solution.

The fixed columns for feasibility, active restrictions, objective value and proof reduce working-memory load while keeping the logical stages separate. Review the table before writing the final conclusion.

Working through Feasible Sets and Types of Optimum in ECON10071? Sia is AskSia’s AI Mathematics tutor — ask any ECON10071 Feasible Sets and Types of Optimum question and get a clear, step-by-step explanation grounded in how ECON10071 is taught and assessed. Read this chapter free, then take your hardest questions to Sia.

A+Everything unlocked
Unlocks this Bible + all 41 of your subjects at The University of Manchester, plus 1,000+ more Bibles across the AskSia library.
Sia - your ECON10071 tutor, unlimited, worked the way the exam marks it
The full 2-page Bible + practice bank with worked solutions
Chrome extension - sync your LMS so Sia knows your deadlines
Bilingual EN / Chinese on every Bible and every Sia answer
$0.99 Trial
30-day money-back · cancel in one tap · how it works