Skip to main content

Mathematical-programming problem

  • Reference work entry
  • First Online:
  • 25 Accesses

A constrained optimization problem usually stated as Minimize (Maximize) f(xv) subject to g i(xv) ≤ 0, i = 1,..., m. Depending on the form of the objective function f(xv) and the constraints g i(xv) the problem will have special properties and associated algorithms. Combinatorial and integer optimization; Convex-programming problem; Fractional programming; Geometric programming; Integer-programming problem; Linear programming; Nonlinear programming; Quadratic programming; Separable-programming problem.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   532.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Kluwer Academic Publishers

About this entry

Cite this entry

Gass, S.I., Harris, C.M. (2001). Mathematical-programming problem . In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_594

Download citation

  • DOI: https://doi.org/10.1007/1-4020-0611-X_594

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-7923-7827-3

  • Online ISBN: 978-1-4020-0611-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics