Mathematics Branches, Topics, and Sub-Topics

A structured visual guide to the major mathematical areas and their relationships.

Search by code, branch, topic, subtopic, or a keyword from the descriptions.

90Cxx Mathematical programming

This subtopic introduces the core ideas in mathematical programming, including foundational concepts, standard methods, and the main questions used to organize the area. Typical uses include building mathematical background, framing related research problems, and supporting applications in neighboring fields where these concepts provide useful structure.

Specific topics

90C05 Linear programming

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with linear programming. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Linear programming

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C06 Large-scale problems in mathematical programming

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with large-scale problems in mathematical programming. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Large-scale problems in mathematical programming

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C08 Special problems of linear programming

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with special problems of linear programming. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Special problems of linear programming

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C09 Boolean programming

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with boolean programming. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Boolean programming

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C10 Integer programming

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with integer programming. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Integer programming

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C11 Mixed integer programming

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with mixed integer programming. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Mixed integer programming

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C15 Stochastic programming

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with stochastic programming. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Stochastic programming

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C17 Robustness and sensitivity analysis of mathematical programming

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with robustness and sensitivity analysis of mathematical programming. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Robustness and sensitivity analysis of mathematical programming

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C20 Quadratic programming

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with quadratic programming. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Quadratic programming

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C22 Semidefinite programming

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with semidefinite programming. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Semidefinite programming

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C23 Polynomial optimization

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with polynomial optimization. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Polynomial optimization

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C24 Semi-infinite programming

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with semi-infinite programming. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Semi-infinite programming

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C25 Convex programming

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with convex programming. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Convex programming

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C26 Nonconvex programming, global optimization

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with nonconvex programming, global optimization. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Nonconvex programming, global optimization

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C27 Combinatorial optimization

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with combinatorial optimization. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Combinatorial optimization

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C29 Multi-objective and goal programming

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with multi-objective and goal programming. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Multi-objective and goal programming

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C30 Nonlinear programming

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with nonlinear programming. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Nonlinear programming

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C31 Sensitivity, stability, parametric optimization

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with sensitivity, stability, parametric optimization. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Sensitivity, stability, parametric optimization

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C32 Fractional programming

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with fractional programming. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Fractional programming

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C33 Complementarity and equilibrium problems and variational inequalities

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with complementarity and equilibrium problems and variational inequalities. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Complementarity and equilibrium problems and variational inequalities

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C34 Semi-infinite programming

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with semi-infinite programming. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Semi-infinite programming

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C35 Programming involving graphs or networks

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with programming involving graphs or networks. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Programming involving graphs or networks

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C39 Dynamic programming

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with dynamic programming. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Dynamic programming

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C40 Markov and semi-Markov decision processes

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with markov and semi-markov decision processes. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Markov and semi-Markov decision processes

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C46 Optimality conditions and duality in mathematical programming

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with optimality conditions and duality in mathematical programming. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Optimality conditions and duality in mathematical programming

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C47 Minimax problems in mathematical programming

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with minimax problems in mathematical programming. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Minimax problems in mathematical programming

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C48 Programming in abstract spaces

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with programming in abstract spaces. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Programming in abstract spaces

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C49 Extreme point and pivoting methods

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with extreme point and pivoting methods. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Extreme point and pivoting methods

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C51 Interior-point methods

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with interior-point methods. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Interior-point methods

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C52 Methods of reduced gradient type

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with methods of reduced gradient type. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Methods of reduced gradient type

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C53 Methods of quasi-Newton type

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with methods of quasi-newton type. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Methods of quasi-Newton type

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C55 Methods of successive quadratic programming type

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with methods of successive quadratic programming type. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Methods of successive quadratic programming type

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C56 Derivative-free methods and methods using generalized derivatives

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with derivative-free methods and methods using generalized derivatives. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Derivative-free methods and methods using generalized derivatives

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with polyhedral combinatorics, branch-and-bound, branch-and-cut. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Polyhedral combinatorics, branch-and-bound, branch-and-cut

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C59 Approximation methods and heuristics in mathematical programming

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with approximation methods and heuristics in mathematical programming. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Approximation methods and heuristics in mathematical programming

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C60 Abstract computational complexity for mathematical programming

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with abstract computational complexity for mathematical programming. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Abstract computational complexity for mathematical programming

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C70 Fuzzy and other nonstochastic uncertainty mathematical programming

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with fuzzy and other nonstochastic uncertainty mathematical programming. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Fuzzy and other nonstochastic uncertainty mathematical programming

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C90 Applications of mathematical programming

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with applications of mathematical programming. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: Applications of mathematical programming

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study

90C99 None of the above

Overview

This specific topic focuses on the core definitions, structural features, and standard questions connected with none of the above. It provides a concise entry point for understanding how this theme fits into the broader mathematical landscape.

Related Wikipedia Page

Wikipedia search: None of the above

Useful Links

Key Ideas

  • Core definitions and equivalent formulations
  • Representative examples and typical counterexamples
  • Connections to neighboring ideas and methods

Typical Uses

This topic is commonly used to frame precise research questions, choose appropriate tools, and organize calculations or constructions within the parent subtopic.

Applications

  • Theoretical research and classification work
  • Modeling and abstraction in adjacent mathematical fields
  • Computational or algorithmic workflows where relevant

References

  • General survey articles and reference works on the surrounding topic
  • Standard monographs and review chapters in the relevant area

Recommended Textbooks

  • An introductory text on the surrounding subtopic
  • An advanced monograph for deeper study