Convex optimizationConvex optimization is a subfield of mathematical optimization that studies the problem of minimizing convex functions over convex sets (or, equivalently, maximizing concave functions over convex sets). Many classes of convex optimization problems admit polynomial-time algorithms, whereas mathematical optimization is in general NP-hard.
Predatory pricingPredatory pricing is a commercial pricing strategy which involves the use of large scale undercutting to eliminate competition. This is where an industry dominant firm with sizable market power will deliberately reduce the prices of a product or service to loss-making levels to attract all consumers and create a monopoly. For a period of time, the prices are set unrealistically low to ensure competitors are unable to effectively compete with the dominant firm without making substantial loss.
Cutting stock problemIn 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. In terms of computational complexity, the problem is an NP-hard problem reducible to the knapsack problem. The problem can be formulated as an integer linear programming problem.
Price gougingPrice gouging is the practice of increasing the prices of goods, services, or commodities to a level much higher than is considered reasonable or fair. Usually, this event occurs after a demand or supply shock. This commonly applies to price increases of basic necessities after natural disasters. The term can also be used to refer to profits obtained by practices inconsistent with a competitive free market, or to windfall profits. In some jurisdictions of the United States during civil emergencies, price gouging is a specific crime.
Karmarkar's algorithmKarmarkar's algorithm is an algorithm introduced by Narendra Karmarkar in 1984 for solving linear programming problems. It was the first reasonably efficient algorithm that solves these problems in polynomial time. The ellipsoid method is also polynomial time but proved to be inefficient in practice. Denoting as the number of variables and as the number of bits of input to the algorithm, Karmarkar's algorithm requires operations on -digit numbers, as compared to such operations for the ellipsoid algorithm.
PriceA price is the (usually not negative) quantity of payment or compensation expected, required, or given by one party to another in return for goods or services. In some situations, the price of production has a different name. If the product is a "good" in the commercial exchange, the payment for this product will likely be called its "price". However, if the product is "service", there will be other possible names for this product's name.
Search algorithmIn computer science, a search algorithm is an algorithm designed to solve a search problem. Search algorithms work to retrieve information stored within particular data structure, or calculated in the search space of a problem domain, with either discrete or continuous values. Although search engines use search algorithms, they belong to the study of information retrieval, not algorithmics. The appropriate search algorithm to use often depends on the data structure being searched, and may also include prior knowledge about the data.
Tacit collusionTacit collusion is a collusion between competitors, which do not explicitly exchange information and achieving an agreement about coordination of conduct. There are two types of tacit collusion – concerted action and conscious parallelism. In a concerted action also known as concerted activity, competitors exchange some information without reaching any explicit agreement, while conscious parallelism implies no communication. In both types of tacit collusion, competitors agree to play a certain strategy without explicitly saying so.
Randomized roundingWithin computer science and operations research, many combinatorial optimization problems are computationally intractable to solve exactly (to optimality). Many such problems do admit fast (polynomial time) approximation algorithms—that is, algorithms that are guaranteed to return an approximately optimal solution given any input. Randomized rounding is a widely used approach for designing and analyzing such approximation algorithms.
Shadow priceA shadow price is the monetary value assigned to an abstract or intangible commodity which is not traded in the marketplace. This often takes the form of an externality. Shadow prices are also known as the recalculation of known market prices in order to account for the presence of distortionary market instruments (e.g. quotas, tariffs, taxes or subsidies). Shadow prices are the real economic prices given to goods and services after they have been appropriately adjusted by removing distortionary market instruments and incorporating the societal impact of the respective good or service.
