On the convexity of the multiplicative version of Karmarkar's potential function

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 1988 English Publisher:Springer Science and Business Media LLCJournal:Mathematical Programming, volume 40-40, pages 29-32 (issn: 0025-5610, eissn: 1436-4646,

Copyright policy )

Authors: Hiroshi Imai;

doi: 10.1007/bf01580721

On the convexity of the multiplicative version of Karmarkar's potential function

- Summary
- Subjects
- Metrics

Abstract

The author shows that the multiplicative version of the potential function is strictly convex on the feasible region of the corresponding linear programming problem when the region is bounded, as is the case in the multiplicative version of Karmarkar's potential function.

Related Organizations

Kyushu University
Japan

Keywords

Linear programming, Karmarkar's potential function, strict convexity, multiplicative version of the potential function

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	19
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%