About: K-convex function

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: K-convex function Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

K-convex functions, first introduced by Scarf, are a special weakening of the concept of convex function which is crucial in the proof of the optimality of the policy in inventory control theory. The policy is characterized by two numbers s and S, , such that when the inventory level falls below level s, an order is issued for a quantity that brings the inventory up to level S, and nothing is ordered otherwise. Gallego and Sethi have generalized the concept of K-convexity to higher dimensional Euclidean spaces.

Attributes	Values
rdfs:label	K-convex function (en)
rdfs:comment	K-convex functions, first introduced by Scarf, are a special weakening of the concept of convex function which is crucial in the proof of the optimality of the policy in inventory control theory. The policy is characterized by two numbers s and S, , such that when the inventory level falls below level s, an order is issued for a quantity that brings the inventory up to level S, and nothing is ordered otherwise. Gallego and Sethi have generalized the concept of K-convexity to higher dimensional Euclidean spaces. (en)
dbp:wikiPageUsesTemplate	dbt:Cite_journal dbt:Mvar dbt:Reflist dbt:ConvexAnalysis
Subject	Convex analysis Types of functions
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/K-convex_function?oldid=1059410841&ns=0
Wikipage page ID	47070537 (xsd:integer)
page length (characters) of wiki page	4718 (xsd:nonNegativeInteger)
Wikipage revision ID	1059410841 (xsd:integer)
Link from a Wikipage to another Wikipage	Convex analysis Types of functions Convex function Herbert Scarf Inventory theory Mathematical optimization
has abstract	K-convex functions, first introduced by Scarf, are a special weakening of the concept of convex function which is crucial in the proof of the optimality of the policy in inventory control theory. The policy is characterized by two numbers s and S, , such that when the inventory level falls below level s, an order is issued for a quantity that brings the inventory up to level S, and nothing is ordered otherwise. Gallego and Sethi have generalized the concept of K-convexity to higher dimensional Euclidean spaces. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/K-convex_function
is Link from a Wikipage to another Wikipage of	Convex function
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/K-convex_function

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (71 GB total memory, 968 MB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software