enow.com Web Search

Search results

1. Results from the WOW.Com Content Network

2. Minimum-cost flow problem - Wikipedia

   en.wikipedia.org/wiki/Minimum-cost_flow_problem

   The minimum-cost flow problem ( MCFP) is an optimization and decision problem to find the cheapest possible way of sending a certain amount of flow through a flow network. A typical application of this problem involves finding the best delivery route from a factory to a warehouse where the road network has some capacity and cost associated.

3. Mathematical optimization - Wikipedia

   en.wikipedia.org/wiki/Mathematical_optimization

   A feasible solution that minimizes (or maximizes) the objective function is called an optimal solution. In mathematics, conventional optimization problems are usually stated in terms of minimization. A local minimum x* is defined as an element for which there exists some δ > 0 such that

4. Packing problems - Wikipedia

   en.wikipedia.org/wiki/Packing_problems

   v. t. e. Packing problems are a class of optimization problems in mathematics that involve attempting to pack objects together into containers. The goal is to either pack a single container as densely as possible or pack all objects using as few containers as possible. Many of these problems can be related to real-life packaging, storage and ...

5. Newsvendor model - Wikipedia

   en.wikipedia.org/wiki/Newsvendor_model

   Newsvendor model. The newsvendor (or newsboy or single-period[ 1] or salvageable) model is a mathematical model in operations management and applied economics used to determine optimal inventory levels. It is (typically) characterized by fixed prices and uncertain demand for a perishable product. If the inventory level is , each unit of demand ...

6. Max-flow min-cut theorem - Wikipedia

   en.wikipedia.org/wiki/Max-flow_min-cut_theorem

   The other half of the max-flow min-cut theorem refers to a different aspect of a network: the collection of cuts. An s-t cut C = (S, T) is a partition of V such that s ∈ S and t ∈ T. That is, an s - t cut is a division of the vertices of the network into two parts, with the source in one part and the sink in the other.

7. Scale analysis (mathematics) - Wikipedia

   en.wikipedia.org/wiki/Scale_analysis_(mathematics)

   Scale analysis (mathematics) Scale analysis (or order-of-magnitude analysis) is a powerful tool used in the mathematical sciences for the simplification of equations with many terms. First the approximate magnitude of individual terms in the equations is determined. Then some negligibly small terms may be ignored.

8. Cutting stock problem - Wikipedia

   en.wikipedia.org/wiki/Cutting_stock_problem

   Cutting stock problem. In operations research, the cutting-stock problem is the problem of cutting standard-sized pieces of stock material, such as paper rolls or sheet metal, into pieces of specified sizes while minimizing material wasted. It is an optimization problem in mathematics that arises from applications in industry.

9. Partition problem - Wikipedia

   en.wikipedia.org/wiki/Partition_problem

   In number theory and computer science, the partition problem, or number partitioning, [ 1] is the task of deciding whether a given multiset S of positive integers can be partitioned into two subsets S1 and S2 such that the sum of the numbers in S1 equals the sum of the numbers in S2. Although the partition problem is NP-complete, there is a ...