Abstract
Optimality in the range space is expressed as a tangency condition for an affine set and a cone. In a previous paper, an algorithm was introduced that reaches tangency keeping the two sets nonintersecting. Here, we introduce an exact finite-convergence evolutive algorithm that reaches tangency while keeping the two sets intersecting. In the process of developing the algorithm, we add some completion to the theory (e.g., the description of the contact polytope). Furthermore, we introduce a new formula to express the maximum, which is the primal counterpart of the dual formula introduced in a previous paper.
Similar content being viewed by others
References
d'Alessandro, P., Dalla Mora, M., and De Santis, E., Techniques of Linear Programming Based on the Theory of Convex Cones, Optimization, Vol. 20, pp. 761–777, 1989.
d'Alessandro, P., A Primal Conical Linear Programming Algorithm, Optimization, Vol. 25, pp. 197–207, 1992.
d'Alessandro, P., A Conical Approach to Linear Programming; Scalar and Vector Optimizations Problems, Gordon and Breach, Amsterdam, Netherlands, 1997.
Giannessi, F., Mastroeni, G., and Pellegrini, L. On the Theory of Vector Optimization and Variational Inequalities; Image Space Analysis and Separation, Vector Variational Inequalities and Vector Equilibria: Mathematical Theories, Edited by F. Giannessi, Kluwer, Dordrecht, Netherlands, pp. 153–216, 2000.
d'Alessandro, P., and De Santis, E., Controlled Invariance and Feedback Laws, IEEE Transactions on Automatic Control, Vol. 46, pp. 1141–1146, 2001.
Ben Israel, A., The Intersection of the Nonnegative Orthant with Complementary Orthogonal Subspaces, Journal of Mathematical Analysis and Applications, Vol. 9, pp. 303–314, 1964.
Author information
Authors and Affiliations
Additional information
Communicated by F. Giannessi
Rights and permissions
About this article
Cite this article
D’Alessandro, P. New Conical Internally Evolutive Linear Programming Algorithm. J Optim Theory Appl 131, 195–207 (2006). https://doi.org/10.1007/s10957-006-9145-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-006-9145-1